./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/heap-manipulation/dancing.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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:02:53,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:02:53,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:02:53,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:02:53,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:02:53,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:02:53,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:02:53,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:02:53,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:02:53,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:02:53,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:02:53,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:02:53,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:02:53,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:02:53,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:02:53,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:02:53,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:02:53,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:02:53,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:02:53,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:02:53,598 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:02:53,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:02:53,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:02:53,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:02:53,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:02:53,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:02:53,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:02:53,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:02:53,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:02:53,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:02:53,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:02:53,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:02:53,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:02:53,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:02:53,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:02:53,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:02:53,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:02:53,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:02:53,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:02:53,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:02:53,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:02:53,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:02:53,610 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:02:53,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:02:53,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:02:53,625 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:02:53,625 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:02:53,626 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:02:53,626 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:02:53,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:02:53,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:02:53,627 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:02:53,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:02:53,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:02:53,627 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:02:53,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:02:53,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:02:53,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:02:53,629 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:02:53,629 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:02:53,630 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:02:53,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:02:53,630 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:02:53,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:02:53,631 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:02:53,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:02:53,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:02:53,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:02:53,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:02:53,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:02:53,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:02:53,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:02:53,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:02:53,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-07-20 06:02:53,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:02:53,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:02:53,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:02:53,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:02:53,871 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:02:53,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-20 06:02:53,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89ba0bd3/98ff6b0f91f9459f9d3657e75d73462b/FLAGf35c749a4 [2022-07-20 06:02:54,283 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:02:54,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-20 06:02:54,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89ba0bd3/98ff6b0f91f9459f9d3657e75d73462b/FLAGf35c749a4 [2022-07-20 06:02:54,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89ba0bd3/98ff6b0f91f9459f9d3657e75d73462b [2022-07-20 06:02:54,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:02:54,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:02:54,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:02:54,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:02:54,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:02:54,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519530ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54, skipping insertion in model container [2022-07-20 06:02:54,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:02:54,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:02:54,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-20 06:02:54,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:02:54,618 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:02:54,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-20 06:02:54,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:02:54,695 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:02:54,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54 WrapperNode [2022-07-20 06:02:54,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:02:54,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:02:54,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:02:54,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:02:54,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,735 INFO L137 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-07-20 06:02:54,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:02:54,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:02:54,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:02:54,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:02:54,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:02:54,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:02:54,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:02:54,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:02:54,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (1/1) ... [2022-07-20 06:02:54,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:02:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:02:54,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:02:54,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:02:54,838 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-20 06:02:54,839 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-20 06:02:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-20 06:02:54,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-20 06:02:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:02:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:02:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 06:02:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:02:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:02:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:02:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:02:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:02:54,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:02:54,918 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:02:54,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:02:55,274 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:02:55,278 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:02:55,278 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 06:02:55,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:02:55 BoogieIcfgContainer [2022-07-20 06:02:55,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:02:55,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:02:55,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:02:55,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:02:55,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:02:54" (1/3) ... [2022-07-20 06:02:55,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d090df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:02:55, skipping insertion in model container [2022-07-20 06:02:55,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:02:54" (2/3) ... [2022-07-20 06:02:55,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d090df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:02:55, skipping insertion in model container [2022-07-20 06:02:55,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:02:55" (3/3) ... [2022-07-20 06:02:55,288 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-20 06:02:55,309 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:02:55,309 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-07-20 06:02:55,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:02:55,355 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1da282bb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b93cf0c [2022-07-20 06:02:55,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-07-20 06:02:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:02:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:02:55,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:55,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:02:55,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:55,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:55,373 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:02:55,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:55,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529173874] [2022-07-20 06:02:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:55,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:55,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529173874] [2022-07-20 06:02:55,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529173874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:02:55,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:02:55,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:02:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536551609] [2022-07-20 06:02:55,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:02:55,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:02:55,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:02:55,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:02:55,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:02:55,562 INFO L87 Difference]: Start difference. First operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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) [2022-07-20 06:02:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:55,644 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-20 06:02:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:02:55,647 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 [2022-07-20 06:02:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:55,652 INFO L225 Difference]: With dead ends: 106 [2022-07-20 06:02:55,652 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 06:02:55,654 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 [2022-07-20 06:02:55,656 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:55,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 94 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:02:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 06:02:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-20 06:02:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 95 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:02:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-07-20 06:02:55,687 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 3 [2022-07-20 06:02:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:55,688 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-07-20 06:02:55,688 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) [2022-07-20 06:02:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-07-20 06:02:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:02:55,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:55,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:02:55,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:02:55,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:55,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:55,690 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:02:55,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:55,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238632445] [2022-07-20 06:02:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:55,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:55,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238632445] [2022-07-20 06:02:55,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238632445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:02:55,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:02:55,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:02:55,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137129427] [2022-07-20 06:02:55,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:02:55,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:02:55,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:02:55,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:02:55,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:02:55,723 INFO L87 Difference]: Start difference. First operand 104 states and 117 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) [2022-07-20 06:02:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:55,776 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-07-20 06:02:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:02:55,777 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 [2022-07-20 06:02:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:55,778 INFO L225 Difference]: With dead ends: 102 [2022-07-20 06:02:55,778 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 06:02:55,778 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 [2022-07-20 06:02:55,779 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:55,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:02:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 06:02:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-20 06:02:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 93 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:02:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-07-20 06:02:55,786 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 3 [2022-07-20 06:02:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:55,787 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-07-20 06:02:55,787 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) [2022-07-20 06:02:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-07-20 06:02:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:02:55,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:55,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:55,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:02:55,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash 59267633, now seen corresponding path program 1 times [2022-07-20 06:02:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:55,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306281623] [2022-07-20 06:02:55,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:55,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:55,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:55,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306281623] [2022-07-20 06:02:55,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306281623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:02:55,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:02:55,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:02:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149413503] [2022-07-20 06:02:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:02:55,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:02:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:02:55,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:02:55,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:02:55,833 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-20 06:02:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:55,927 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-07-20 06:02:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:02:55,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2022-07-20 06:02:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:55,932 INFO L225 Difference]: With dead ends: 165 [2022-07-20 06:02:55,933 INFO L226 Difference]: Without dead ends: 165 [2022-07-20 06:02:55,934 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 [2022-07-20 06:02:55,939 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:55,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:02:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-20 06:02:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2022-07-20 06:02:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 91 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:02:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-20 06:02:55,956 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 8 [2022-07-20 06:02:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:55,957 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-20 06:02:55,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-20 06:02:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-07-20 06:02:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:02:55,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:55,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:55,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:02:55,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:55,959 INFO L85 PathProgramCache]: Analyzing trace with hash 59267634, now seen corresponding path program 1 times [2022-07-20 06:02:55,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:55,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602558462] [2022-07-20 06:02:55,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:55,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:56,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:56,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602558462] [2022-07-20 06:02:56,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602558462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:02:56,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:02:56,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:02:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023388433] [2022-07-20 06:02:56,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:02:56,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:02:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:02:56,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:02:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:02:56,027 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-20 06:02:56,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:56,123 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2022-07-20 06:02:56,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:02:56,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2022-07-20 06:02:56,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:56,125 INFO L225 Difference]: With dead ends: 165 [2022-07-20 06:02:56,125 INFO L226 Difference]: Without dead ends: 165 [2022-07-20 06:02:56,125 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 [2022-07-20 06:02:56,126 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:56,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 217 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:02:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-20 06:02:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2022-07-20 06:02:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:02:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-20 06:02:56,132 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 8 [2022-07-20 06:02:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:56,132 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-20 06:02:56,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-20 06:02:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-20 06:02:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:02:56,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:56,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:56,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:02:56,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:56,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:56,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1124238034, now seen corresponding path program 1 times [2022-07-20 06:02:56,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:56,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665751184] [2022-07-20 06:02:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:56,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:56,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665751184] [2022-07-20 06:02:56,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665751184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:02:56,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:02:56,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:02:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846872208] [2022-07-20 06:02:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:02:56,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:02:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:02:56,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:02:56,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:02:56,180 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:02:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:56,230 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2022-07-20 06:02:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:02:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 06:02:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:56,232 INFO L225 Difference]: With dead ends: 176 [2022-07-20 06:02:56,233 INFO L226 Difference]: Without dead ends: 176 [2022-07-20 06:02:56,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:02:56,234 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:56,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 403 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:02:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-20 06:02:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2022-07-20 06:02:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.89247311827957) internal successors, (176), 129 states have internal predecessors, (176), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-20 06:02:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2022-07-20 06:02:56,241 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 10 [2022-07-20 06:02:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:56,242 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2022-07-20 06:02:56,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:02:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2022-07-20 06:02:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:02:56,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:56,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:56,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:02:56,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1121620373, now seen corresponding path program 1 times [2022-07-20 06:02:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442062992] [2022-07-20 06:02:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:56,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:56,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442062992] [2022-07-20 06:02:56,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442062992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:02:56,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:02:56,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:02:56,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191622050] [2022-07-20 06:02:56,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:02:56,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:02:56,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:02:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:02:56,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:02:56,338 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:02:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:56,435 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2022-07-20 06:02:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:02:56,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 06:02:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:56,436 INFO L225 Difference]: With dead ends: 140 [2022-07-20 06:02:56,437 INFO L226 Difference]: Without dead ends: 140 [2022-07-20 06:02:56,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:02:56,438 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 218 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:56,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 105 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:02:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-20 06:02:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-20 06:02:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 127 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-20 06:02:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2022-07-20 06:02:56,444 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 10 [2022-07-20 06:02:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:56,444 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2022-07-20 06:02:56,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:02:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2022-07-20 06:02:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:02:56,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:56,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:56,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:02:56,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:56,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990355, now seen corresponding path program 1 times [2022-07-20 06:02:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:56,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582170821] [2022-07-20 06:02:56,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:02:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:56,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:56,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582170821] [2022-07-20 06:02:56,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582170821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:02:56,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:02:56,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:02:56,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081317183] [2022-07-20 06:02:56,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:02:56,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:02:56,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:02:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:02:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:02:56,496 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:02:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:56,660 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2022-07-20 06:02:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:02:56,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-20 06:02:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:56,662 INFO L225 Difference]: With dead ends: 159 [2022-07-20 06:02:56,662 INFO L226 Difference]: Without dead ends: 159 [2022-07-20 06:02:56,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:02:56,663 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 238 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:56,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 203 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:02:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-20 06:02:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2022-07-20 06:02:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.7311827956989247) internal successors, (161), 122 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-20 06:02:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2022-07-20 06:02:56,668 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 15 [2022-07-20 06:02:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:56,669 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2022-07-20 06:02:56,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:02:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2022-07-20 06:02:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:02:56,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:56,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:56,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:02:56,670 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:56,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990356, now seen corresponding path program 1 times [2022-07-20 06:02:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:56,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255626768] [2022-07-20 06:02:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:02:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:56,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:56,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255626768] [2022-07-20 06:02:56,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255626768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:02:56,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:02:56,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:02:56,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845496101] [2022-07-20 06:02:56,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:02:56,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:02:56,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:02:56,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:02:56,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:02:56,738 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:02:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:56,907 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2022-07-20 06:02:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:02:56,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-20 06:02:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:56,909 INFO L225 Difference]: With dead ends: 155 [2022-07-20 06:02:56,909 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 06:02:56,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:02:56,910 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 288 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:56,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 186 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:02:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 06:02:56,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2022-07-20 06:02:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.6666666666666667) internal successors, (155), 122 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-20 06:02:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2022-07-20 06:02:56,915 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 15 [2022-07-20 06:02:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:56,916 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2022-07-20 06:02:56,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:02:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2022-07-20 06:02:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:02:56,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:56,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:56,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:02:56,917 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:56,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148901, now seen corresponding path program 1 times [2022-07-20 06:02:56,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:56,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925466906] [2022-07-20 06:02:56,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:56,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:56,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925466906] [2022-07-20 06:02:56,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925466906] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:56,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719444938] [2022-07-20 06:02:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:56,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:02:56,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:02:56,961 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) [2022-07-20 06:02:56,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 06:02:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:57,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:02:57,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:57,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:02:57,207 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:02:57,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-20 06:02:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:57,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:02:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:58,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719444938] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:02:58,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:02:58,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2022-07-20 06:02:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219283887] [2022-07-20 06:02:58,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:02:58,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 06:02:58,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:02:58,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 06:02:58,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:02:58,631 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:02:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:59,160 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2022-07-20 06:02:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:02:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:02:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:59,161 INFO L225 Difference]: With dead ends: 200 [2022-07-20 06:02:59,161 INFO L226 Difference]: Without dead ends: 200 [2022-07-20 06:02:59,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:02:59,162 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 362 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:59,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 447 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:02:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-20 06:02:59,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 143. [2022-07-20 06:02:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.65) internal successors, (165), 128 states have internal predecessors, (165), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-20 06:02:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2022-07-20 06:02:59,168 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 16 [2022-07-20 06:02:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:59,169 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2022-07-20 06:02:59,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:02:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2022-07-20 06:02:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:02:59,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:59,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:59,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:02:59,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:02:59,382 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:02:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148902, now seen corresponding path program 1 times [2022-07-20 06:02:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:02:59,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186895813] [2022-07-20 06:02:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:59,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:02:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:59,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:02:59,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186895813] [2022-07-20 06:02:59,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186895813] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:59,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642171650] [2022-07-20 06:02:59,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:59,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:02:59,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:02:59,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:02:59,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 06:02:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:59,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:02:59,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:59,690 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:02:59,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-20 06:02:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:02:59,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:00,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-07-20 06:03:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:00,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642171650] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:00,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:00,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-07-20 06:03:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702913186] [2022-07-20 06:03:00,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:00,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 06:03:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 06:03:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:03:00,137 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:00,774 INFO L93 Difference]: Finished difference Result 197 states and 251 transitions. [2022-07-20 06:03:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:03:00,775 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:03:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:00,776 INFO L225 Difference]: With dead ends: 197 [2022-07-20 06:03:00,776 INFO L226 Difference]: Without dead ends: 197 [2022-07-20 06:03:00,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:03:00,777 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 495 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:00,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 497 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:03:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-20 06:03:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 142. [2022-07-20 06:03:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.62) internal successors, (162), 127 states have internal predecessors, (162), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-20 06:03:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2022-07-20 06:03:00,781 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 16 [2022-07-20 06:03:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:00,781 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2022-07-20 06:03:00,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2022-07-20 06:03:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:03:00,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:00,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:00,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-20 06:03:00,999 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,SelfDestructingSolverStorable9 [2022-07-20 06:03:00,999 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:01,000 INFO L85 PathProgramCache]: Analyzing trace with hash -992190633, now seen corresponding path program 1 times [2022-07-20 06:03:01,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:01,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162650395] [2022-07-20 06:03:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:03:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:01,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162650395] [2022-07-20 06:03:01,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162650395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:01,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:01,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:03:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479771674] [2022-07-20 06:03:01,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:01,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:03:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:01,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:03:01,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:03:01,186 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:01,420 INFO L93 Difference]: Finished difference Result 190 states and 242 transitions. [2022-07-20 06:03:01,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:03:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-20 06:03:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:01,422 INFO L225 Difference]: With dead ends: 190 [2022-07-20 06:03:01,422 INFO L226 Difference]: Without dead ends: 190 [2022-07-20 06:03:01,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:03:01,422 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 187 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:01,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 395 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-20 06:03:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2022-07-20 06:03:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.5981308411214954) internal successors, (171), 134 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-20 06:03:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2022-07-20 06:03:01,426 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 19 [2022-07-20 06:03:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:01,426 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2022-07-20 06:03:01,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2022-07-20 06:03:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:03:01,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:01,428 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] [2022-07-20 06:03:01,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:03:01,429 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:01,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash 343557913, now seen corresponding path program 1 times [2022-07-20 06:03:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:01,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636545619] [2022-07-20 06:03:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:01,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:01,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:03:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:01,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:01,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636545619] [2022-07-20 06:03:01,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636545619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:01,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:01,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:03:01,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952051728] [2022-07-20 06:03:01,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:01,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:03:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:03:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:01,560 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:01,741 INFO L93 Difference]: Finished difference Result 185 states and 236 transitions. [2022-07-20 06:03:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-20 06:03:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:01,744 INFO L225 Difference]: With dead ends: 185 [2022-07-20 06:03:01,744 INFO L226 Difference]: Without dead ends: 185 [2022-07-20 06:03:01,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:03:01,745 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 135 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:01,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 397 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-20 06:03:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 152. [2022-07-20 06:03:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5871559633027523) internal successors, (173), 136 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-20 06:03:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 197 transitions. [2022-07-20 06:03:01,752 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 197 transitions. Word has length 21 [2022-07-20 06:03:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:01,753 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 197 transitions. [2022-07-20 06:03:01,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2022-07-20 06:03:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:03:01,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:01,755 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] [2022-07-20 06:03:01,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 06:03:01,755 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 451808416, now seen corresponding path program 1 times [2022-07-20 06:03:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:01,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941792298] [2022-07-20 06:03:01,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:01,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:01,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941792298] [2022-07-20 06:03:01,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941792298] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:01,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885979295] [2022-07-20 06:03:01,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:01,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:01,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:01,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:01,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 06:03:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:02,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 06:03:02,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:02,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:03:02,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:02,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:03,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:03,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2022-07-20 06:03:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:03,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885979295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:03,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:03,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2022-07-20 06:03:03,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291543628] [2022-07-20 06:03:03,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:03,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 06:03:03,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:03,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 06:03:03,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-07-20 06:03:03,252 INFO L87 Difference]: Start difference. First operand 152 states and 197 transitions. Second operand has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:05,203 INFO L93 Difference]: Finished difference Result 500 states and 656 transitions. [2022-07-20 06:03:05,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:03:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:03:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:05,207 INFO L225 Difference]: With dead ends: 500 [2022-07-20 06:03:05,207 INFO L226 Difference]: Without dead ends: 500 [2022-07-20 06:03:05,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2022-07-20 06:03:05,208 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 1024 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:05,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1635 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1932 Invalid, 0 Unknown, 100 Unchecked, 1.4s Time] [2022-07-20 06:03:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-07-20 06:03:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 237. [2022-07-20 06:03:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5795454545454546) internal successors, (278), 206 states have internal predecessors, (278), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 06:03:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 328 transitions. [2022-07-20 06:03:05,225 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 328 transitions. Word has length 22 [2022-07-20 06:03:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:05,225 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 328 transitions. [2022-07-20 06:03:05,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 328 transitions. [2022-07-20 06:03:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:03:05,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:05,228 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] [2022-07-20 06:03:05,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 06:03:05,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:05,446 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:05,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1286860128, now seen corresponding path program 1 times [2022-07-20 06:03:05,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:05,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51986676] [2022-07-20 06:03:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:05,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:03:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:05,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:05,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51986676] [2022-07-20 06:03:05,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51986676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:05,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672216401] [2022-07-20 06:03:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:05,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:05,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:05,531 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:05,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 06:03:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:05,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:03:05,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:05,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:05,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672216401] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:05,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:05,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-20 06:03:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377843292] [2022-07-20 06:03:05,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:05,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 06:03:05,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 06:03:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:03:05,877 INFO L87 Difference]: Start difference. First operand 237 states and 328 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:03:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:06,407 INFO L93 Difference]: Finished difference Result 305 states and 388 transitions. [2022-07-20 06:03:06,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:06,407 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2022-07-20 06:03:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:06,408 INFO L225 Difference]: With dead ends: 305 [2022-07-20 06:03:06,408 INFO L226 Difference]: Without dead ends: 299 [2022-07-20 06:03:06,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:03:06,409 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 299 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:06,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 630 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:03:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-20 06:03:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 237. [2022-07-20 06:03:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5625) internal successors, (275), 206 states have internal predecessors, (275), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-20 06:03:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2022-07-20 06:03:06,417 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 21 [2022-07-20 06:03:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:06,417 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2022-07-20 06:03:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:03:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-07-20 06:03:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:03:06,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:06,419 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] [2022-07-20 06:03:06,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:06,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:06,619 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:06,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1821114983, now seen corresponding path program 1 times [2022-07-20 06:03:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:06,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726801444] [2022-07-20 06:03:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:06,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:03:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:06,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:06,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726801444] [2022-07-20 06:03:06,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726801444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:06,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:06,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:03:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716852440] [2022-07-20 06:03:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:06,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:06,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:06,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:06,668 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:06,701 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2022-07-20 06:03:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:03:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-20 06:03:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:06,705 INFO L225 Difference]: With dead ends: 251 [2022-07-20 06:03:06,705 INFO L226 Difference]: Without dead ends: 251 [2022-07-20 06:03:06,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:03:06,707 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:06,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 389 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:03:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-20 06:03:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 246. [2022-07-20 06:03:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 179 states have (on average 1.553072625698324) internal successors, (278), 214 states have internal predecessors, (278), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-20 06:03:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 338 transitions. [2022-07-20 06:03:06,733 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 338 transitions. Word has length 24 [2022-07-20 06:03:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:06,735 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 338 transitions. [2022-07-20 06:03:06,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 338 transitions. [2022-07-20 06:03:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:03:06,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:06,736 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] [2022-07-20 06:03:06,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:03:06,737 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275188, now seen corresponding path program 1 times [2022-07-20 06:03:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:06,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422531205] [2022-07-20 06:03:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:03:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:06,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:06,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422531205] [2022-07-20 06:03:06,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422531205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:06,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:06,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:06,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812790080] [2022-07-20 06:03:06,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:06,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:06,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:06,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:06,815 INFO L87 Difference]: Start difference. First operand 246 states and 338 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:07,051 INFO L93 Difference]: Finished difference Result 304 states and 389 transitions. [2022-07-20 06:03:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:07,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-20 06:03:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:07,053 INFO L225 Difference]: With dead ends: 304 [2022-07-20 06:03:07,053 INFO L226 Difference]: Without dead ends: 304 [2022-07-20 06:03:07,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:03:07,054 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 206 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:07,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 254 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-20 06:03:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 245. [2022-07-20 06:03:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 179 states have (on average 1.541899441340782) internal successors, (276), 213 states have internal predecessors, (276), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-20 06:03:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 336 transitions. [2022-07-20 06:03:07,059 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 336 transitions. Word has length 23 [2022-07-20 06:03:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:07,061 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 336 transitions. [2022-07-20 06:03:07,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 336 transitions. [2022-07-20 06:03:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:03:07,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:07,063 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] [2022-07-20 06:03:07,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:03:07,063 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275187, now seen corresponding path program 1 times [2022-07-20 06:03:07,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:07,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198600619] [2022-07-20 06:03:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:07,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:03:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:07,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:07,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198600619] [2022-07-20 06:03:07,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198600619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:07,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:07,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780602442] [2022-07-20 06:03:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:07,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:07,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:07,149 INFO L87 Difference]: Start difference. First operand 245 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:07,370 INFO L93 Difference]: Finished difference Result 302 states and 382 transitions. [2022-07-20 06:03:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:03:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-20 06:03:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:07,371 INFO L225 Difference]: With dead ends: 302 [2022-07-20 06:03:07,372 INFO L226 Difference]: Without dead ends: 302 [2022-07-20 06:03:07,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:07,372 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 194 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:07,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 349 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-20 06:03:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 239. [2022-07-20 06:03:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 179 states have (on average 1.4916201117318435) internal successors, (267), 207 states have internal predecessors, (267), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-20 06:03:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 327 transitions. [2022-07-20 06:03:07,380 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 327 transitions. Word has length 23 [2022-07-20 06:03:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:07,380 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 327 transitions. [2022-07-20 06:03:07,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 327 transitions. [2022-07-20 06:03:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:03:07,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:07,381 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] [2022-07-20 06:03:07,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:03:07,382 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:07,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398490, now seen corresponding path program 1 times [2022-07-20 06:03:07,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:07,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145165348] [2022-07-20 06:03:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:07,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:03:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:07,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:07,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145165348] [2022-07-20 06:03:07,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145165348] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:07,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369379021] [2022-07-20 06:03:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:07,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:07,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:07,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:03:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:08,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 06:03:08,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:08,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:03:08,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:08,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:08,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 21 [2022-07-20 06:03:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:08,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:08,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369379021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:08,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:03:08,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2022-07-20 06:03:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79375431] [2022-07-20 06:03:08,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:08,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 06:03:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 06:03:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-07-20 06:03:08,700 INFO L87 Difference]: Start difference. First operand 239 states and 327 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:11,042 INFO L93 Difference]: Finished difference Result 552 states and 721 transitions. [2022-07-20 06:03:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 06:03:11,043 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-20 06:03:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:11,045 INFO L225 Difference]: With dead ends: 552 [2022-07-20 06:03:11,045 INFO L226 Difference]: Without dead ends: 552 [2022-07-20 06:03:11,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=316, Invalid=1576, Unknown=0, NotChecked=0, Total=1892 [2022-07-20 06:03:11,046 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 594 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:11,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1968 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1669 Invalid, 0 Unknown, 654 Unchecked, 1.3s Time] [2022-07-20 06:03:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-07-20 06:03:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 252. [2022-07-20 06:03:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 218 states have internal predecessors, (280), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 22 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-20 06:03:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 342 transitions. [2022-07-20 06:03:11,069 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 342 transitions. Word has length 25 [2022-07-20 06:03:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:11,070 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 342 transitions. [2022-07-20 06:03:11,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 342 transitions. [2022-07-20 06:03:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:03:11,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:11,071 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] [2022-07-20 06:03:11,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 06:03:11,283 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398489, now seen corresponding path program 1 times [2022-07-20 06:03:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:11,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220370633] [2022-07-20 06:03:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:11,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:03:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:11,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220370633] [2022-07-20 06:03:11,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220370633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:11,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514843593] [2022-07-20 06:03:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:11,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:11,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:11,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:11,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 06:03:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:11,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-20 06:03:11,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:12,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:12,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:12,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 9 [2022-07-20 06:03:12,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:12,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:12,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 72 [2022-07-20 06:03:12,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 106 [2022-07-20 06:03:12,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:12,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:12,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 [2022-07-20 06:03:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:12,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514843593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:12,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:12,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 26 [2022-07-20 06:03:12,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991115981] [2022-07-20 06:03:12,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:12,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 06:03:12,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:12,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 06:03:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-07-20 06:03:12,500 INFO L87 Difference]: Start difference. First operand 252 states and 342 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:03:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:14,498 INFO L93 Difference]: Finished difference Result 410 states and 506 transitions. [2022-07-20 06:03:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:03:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2022-07-20 06:03:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:14,500 INFO L225 Difference]: With dead ends: 410 [2022-07-20 06:03:14,500 INFO L226 Difference]: Without dead ends: 410 [2022-07-20 06:03:14,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2022-07-20 06:03:14,501 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 582 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:14,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1297 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1483 Invalid, 0 Unknown, 80 Unchecked, 1.1s Time] [2022-07-20 06:03:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-20 06:03:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 261. [2022-07-20 06:03:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 225 states have internal predecessors, (284), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-20 06:03:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 348 transitions. [2022-07-20 06:03:14,511 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 348 transitions. Word has length 25 [2022-07-20 06:03:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:14,512 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 348 transitions. [2022-07-20 06:03:14,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:03:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 348 transitions. [2022-07-20 06:03:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:03:14,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:14,513 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] [2022-07-20 06:03:14,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:14,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:14,727 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361463, now seen corresponding path program 1 times [2022-07-20 06:03:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:14,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992295743] [2022-07-20 06:03:14,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:14,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:14,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:03:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:14,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 06:03:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:14,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992295743] [2022-07-20 06:03:14,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992295743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:14,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:14,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:03:14,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204464729] [2022-07-20 06:03:14,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:14,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:03:14,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:14,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:03:14,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:03:14,779 INFO L87 Difference]: Start difference. First operand 261 states and 348 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:14,934 INFO L93 Difference]: Finished difference Result 271 states and 340 transitions. [2022-07-20 06:03:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:03:14,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-20 06:03:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:14,936 INFO L225 Difference]: With dead ends: 271 [2022-07-20 06:03:14,936 INFO L226 Difference]: Without dead ends: 271 [2022-07-20 06:03:14,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:03:14,936 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 159 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:14,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 195 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-20 06:03:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 258. [2022-07-20 06:03:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3928571428571428) internal successors, (273), 222 states have internal predecessors, (273), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-20 06:03:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 337 transitions. [2022-07-20 06:03:14,941 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 337 transitions. Word has length 27 [2022-07-20 06:03:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:14,941 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 337 transitions. [2022-07-20 06:03:14,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 337 transitions. [2022-07-20 06:03:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:03:14,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:14,942 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] [2022-07-20 06:03:14,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 06:03:14,942 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361464, now seen corresponding path program 1 times [2022-07-20 06:03:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:14,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116332565] [2022-07-20 06:03:14,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:14,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:03:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 06:03:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:15,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116332565] [2022-07-20 06:03:15,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116332565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:15,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:15,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:03:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723214918] [2022-07-20 06:03:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:15,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:03:15,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:03:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:03:15,003 INFO L87 Difference]: Start difference. First operand 258 states and 337 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:15,147 INFO L93 Difference]: Finished difference Result 269 states and 335 transitions. [2022-07-20 06:03:15,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:03:15,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-20 06:03:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:15,149 INFO L225 Difference]: With dead ends: 269 [2022-07-20 06:03:15,149 INFO L226 Difference]: Without dead ends: 269 [2022-07-20 06:03:15,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:03:15,150 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 214 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:15,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 167 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-20 06:03:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2022-07-20 06:03:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 222 states have internal predecessors, (267), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-20 06:03:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 331 transitions. [2022-07-20 06:03:15,154 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 331 transitions. Word has length 27 [2022-07-20 06:03:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:15,155 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 331 transitions. [2022-07-20 06:03:15,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 331 transitions. [2022-07-20 06:03:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:03:15,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:15,156 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] [2022-07-20 06:03:15,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 06:03:15,157 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 468828335, now seen corresponding path program 1 times [2022-07-20 06:03:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:15,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399398056] [2022-07-20 06:03:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:15,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:03:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:15,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:15,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399398056] [2022-07-20 06:03:15,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399398056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:15,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:15,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:03:15,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124288799] [2022-07-20 06:03:15,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:15,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:03:15,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:15,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:03:15,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:15,188 INFO L87 Difference]: Start difference. First operand 258 states and 331 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:15,195 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2022-07-20 06:03:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:03:15,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-20 06:03:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:15,196 INFO L225 Difference]: With dead ends: 267 [2022-07-20 06:03:15,196 INFO L226 Difference]: Without dead ends: 267 [2022-07-20 06:03:15,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:15,212 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:15,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:03:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-20 06:03:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2022-07-20 06:03:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 180 states have (on average 1.3611111111111112) internal successors, (245), 205 states have internal predecessors, (245), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-20 06:03:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 305 transitions. [2022-07-20 06:03:15,217 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 305 transitions. Word has length 26 [2022-07-20 06:03:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:15,218 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 305 transitions. [2022-07-20 06:03:15,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 305 transitions. [2022-07-20 06:03:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:03:15,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:15,218 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] [2022-07-20 06:03:15,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 06:03:15,219 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1109218320, now seen corresponding path program 1 times [2022-07-20 06:03:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:15,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816003267] [2022-07-20 06:03:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:15,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:15,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:03:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:15,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816003267] [2022-07-20 06:03:15,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816003267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:15,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:15,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:03:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092134466] [2022-07-20 06:03:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:15,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:15,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:15,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:15,288 INFO L87 Difference]: Start difference. First operand 238 states and 305 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:15,314 INFO L93 Difference]: Finished difference Result 252 states and 324 transitions. [2022-07-20 06:03:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:03:15,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-20 06:03:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:15,316 INFO L225 Difference]: With dead ends: 252 [2022-07-20 06:03:15,316 INFO L226 Difference]: Without dead ends: 248 [2022-07-20 06:03:15,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:03:15,317 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:15,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:03:15,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-20 06:03:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2022-07-20 06:03:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 182 states have (on average 1.3571428571428572) internal successors, (247), 209 states have internal predecessors, (247), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (34), 21 states have call predecessors, (34), 30 states have call successors, (34) [2022-07-20 06:03:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 311 transitions. [2022-07-20 06:03:15,335 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 311 transitions. Word has length 27 [2022-07-20 06:03:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:15,335 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 311 transitions. [2022-07-20 06:03:15,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:03:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 311 transitions. [2022-07-20 06:03:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:03:15,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:15,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:15,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 06:03:15,336 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash -815173774, now seen corresponding path program 1 times [2022-07-20 06:03:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:15,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000808756] [2022-07-20 06:03:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:15,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:15,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000808756] [2022-07-20 06:03:15,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000808756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:15,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182649580] [2022-07-20 06:03:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:15,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:15,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:15,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:15,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 06:03:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:15,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-20 06:03:15,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:15,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:15,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:15,963 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:15,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-07-20 06:03:15,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 06:03:15,979 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:15,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-07-20 06:03:15,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 06:03:16,024 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:16,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-07-20 06:03:16,038 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:16,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-07-20 06:03:16,058 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 06:03:16,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 30 [2022-07-20 06:03:16,075 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 06:03:16,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 30 [2022-07-20 06:03:16,180 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:03:16,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:03:16,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:03:16,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 [2022-07-20 06:03:16,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-07-20 06:03:16,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-07-20 06:03:16,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 [2022-07-20 06:03:16,405 INFO L356 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2022-07-20 06:03:16,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2022-07-20 06:03:16,418 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 06:03:16,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-20 06:03:16,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-07-20 06:03:16,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:16,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:17,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 132 treesize of output 108 [2022-07-20 06:03:18,378 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:03:18,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:21,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse0 (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse1 (select (select (let ((.cse2 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (and (<= .cse0 0) (= .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|) (<= 0 (+ .cse0 4))) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (and (= .cse0 0) (= .cse1 0)))))) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2022-07-20 06:03:26,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse0 (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse1 (select (select (let ((.cse2 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (and (<= .cse0 0) (= .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|) (<= 0 (+ .cse0 4))) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (and (= .cse0 0) (= .cse1 0)))))) is different from false [2022-07-20 06:03:28,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse0 (select (store (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 0) .cse4)) (.cse1 (select (store (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse4))) (or (and (= .cse0 0) (= .cse1 0)) (and (<= .cse0 0) (<= 0 (+ .cse0 4)) (= .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|)) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) is different from false [2022-07-20 06:03:28,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:28,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 220 [2022-07-20 06:03:28,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:28,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 231 treesize of output 223 [2022-07-20 06:03:28,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:28,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 185 [2022-07-20 06:03:28,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:28,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 191 treesize of output 185 [2022-07-20 06:03:28,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 205 treesize of output 197 [2022-07-20 06:03:28,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 212 treesize of output 200 [2022-07-20 06:03:28,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 211 treesize of output 195 [2022-07-20 06:03:28,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 147 treesize of output 135 [2022-07-20 06:03:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:03:28,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182649580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:28,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:28,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 20] total 49 [2022-07-20 06:03:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784634784] [2022-07-20 06:03:28,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:28,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 06:03:28,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:28,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 06:03:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1997, Unknown=8, NotChecked=276, Total=2450 [2022-07-20 06:03:28,614 INFO L87 Difference]: Start difference. First operand 242 states and 311 transitions. Second operand has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:28,651 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (<= .cse0 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (<= 8 .cse0) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse5 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse2 (select (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 0) .cse6)) (.cse3 (select (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse6))) (or (and (= .cse2 0) (= .cse3 0)) (and (<= .cse2 0) (<= 0 (+ .cse2 4)) (= .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|)) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) is different from false [2022-07-20 06:03:28,655 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (<= .cse0 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (<= 8 .cse0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse5 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse2 (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7)) (.cse3 (select (select (let ((.cse4 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7))) (or (and (<= .cse2 0) (= .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|) (<= 0 (+ .cse2 4))) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (and (= .cse2 0) (= .cse3 0)))))) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |c_ULTIMATE.start_main_~tail~0#1.offset| 0))) is different from false [2022-07-20 06:03:30,671 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse1 (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~n~0#1.offset| 0))) (and (or (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~tail~0#1.base|))) (and (<= 8 .cse0) .cse1 .cse2 (<= .cse0 8)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3)) (= (+ |c_ULTIMATE.start_main_~#list~0#1.offset| (* |c_ULTIMATE.start_main_~tail~0#1.offset| (- 1))) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) .cse1 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) .cse2 (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse4 (select (select (let ((.cse10 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9)) (.cse5 (select (select (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9))) (or (and (<= .cse4 0) (= .cse5 |v_ULTIMATE.start_main_~n~0#1.base_21|) (<= 0 (+ .cse4 4))) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (and (= .cse4 0) (= .cse5 0)))))) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) is different from false [2022-07-20 06:03:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:35,862 INFO L93 Difference]: Finished difference Result 743 states and 942 transitions. [2022-07-20 06:03:35,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-07-20 06:03:35,863 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 06:03:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:35,865 INFO L225 Difference]: With dead ends: 743 [2022-07-20 06:03:35,865 INFO L226 Difference]: Without dead ends: 743 [2022-07-20 06:03:35,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=623, Invalid=6871, Unknown=12, NotChecked=1050, Total=8556 [2022-07-20 06:03:35,867 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 1460 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 5883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2637 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:35,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2521 Invalid, 5883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2930 Invalid, 0 Unknown, 2637 Unchecked, 2.1s Time] [2022-07-20 06:03:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-07-20 06:03:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 327. [2022-07-20 06:03:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 252 states have (on average 1.3492063492063493) internal successors, (340), 283 states have internal predecessors, (340), 40 states have call successors, (40), 15 states have call predecessors, (40), 18 states have return successors, (46), 28 states have call predecessors, (46), 40 states have call successors, (46) [2022-07-20 06:03:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 426 transitions. [2022-07-20 06:03:35,879 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 426 transitions. Word has length 28 [2022-07-20 06:03:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:35,880 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 426 transitions. [2022-07-20 06:03:35,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 426 transitions. [2022-07-20 06:03:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:03:35,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:35,881 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] [2022-07-20 06:03:35,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:36,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:36,095 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1709630296, now seen corresponding path program 1 times [2022-07-20 06:03:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:36,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311807705] [2022-07-20 06:03:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:36,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:03:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:36,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:36,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311807705] [2022-07-20 06:03:36,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311807705] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:36,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284935117] [2022-07-20 06:03:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:36,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:36,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:36,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:36,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:03:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:36,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 06:03:36,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:36,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:03:36,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:36,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 20 [2022-07-20 06:03:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:36,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:36,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284935117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:36,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:03:36,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2022-07-20 06:03:36,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511725692] [2022-07-20 06:03:36,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:36,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 06:03:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 06:03:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:03:36,829 INFO L87 Difference]: Start difference. First operand 327 states and 426 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:37,377 INFO L93 Difference]: Finished difference Result 348 states and 448 transitions. [2022-07-20 06:03:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:03:37,378 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-20 06:03:37,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:37,379 INFO L225 Difference]: With dead ends: 348 [2022-07-20 06:03:37,379 INFO L226 Difference]: Without dead ends: 347 [2022-07-20 06:03:37,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 06:03:37,380 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 150 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:37,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 892 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 348 Invalid, 0 Unknown, 137 Unchecked, 0.3s Time] [2022-07-20 06:03:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-20 06:03:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 308. [2022-07-20 06:03:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 238 states have (on average 1.3487394957983194) internal successors, (321), 267 states have internal predecessors, (321), 36 states have call successors, (36), 14 states have call predecessors, (36), 17 states have return successors, (42), 26 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-20 06:03:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 399 transitions. [2022-07-20 06:03:37,385 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 399 transitions. Word has length 27 [2022-07-20 06:03:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:37,386 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 399 transitions. [2022-07-20 06:03:37,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2022-07-20 06:03:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:03:37,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:37,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:37,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:37,601 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,SelfDestructingSolverStorable24 [2022-07-20 06:03:37,601 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:37,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1952238210, now seen corresponding path program 1 times [2022-07-20 06:03:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:37,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425016379] [2022-07-20 06:03:37,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:37,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:37,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:03:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:37,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 06:03:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 06:03:37,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:37,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425016379] [2022-07-20 06:03:37,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425016379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:37,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:37,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:37,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816643984] [2022-07-20 06:03:37,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:37,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:37,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:37,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:37,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:37,649 INFO L87 Difference]: Start difference. First operand 308 states and 399 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:37,671 INFO L93 Difference]: Finished difference Result 317 states and 400 transitions. [2022-07-20 06:03:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:03:37,671 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-20 06:03:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:37,673 INFO L225 Difference]: With dead ends: 317 [2022-07-20 06:03:37,673 INFO L226 Difference]: Without dead ends: 317 [2022-07-20 06:03:37,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:37,674 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:37,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 253 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:03:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-20 06:03:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2022-07-20 06:03:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 237 states have (on average 1.3459915611814346) internal successors, (319), 265 states have internal predecessors, (319), 34 states have call successors, (34), 14 states have call predecessors, (34), 17 states have return successors, (40), 25 states have call predecessors, (40), 34 states have call successors, (40) [2022-07-20 06:03:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 393 transitions. [2022-07-20 06:03:37,699 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 393 transitions. Word has length 30 [2022-07-20 06:03:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:37,699 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 393 transitions. [2022-07-20 06:03:37,700 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 393 transitions. [2022-07-20 06:03:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:03:37,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:37,701 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] [2022-07-20 06:03:37,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 06:03:37,702 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:37,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1439567607, now seen corresponding path program 1 times [2022-07-20 06:03:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:37,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027376493] [2022-07-20 06:03:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:03:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 06:03:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:37,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:37,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027376493] [2022-07-20 06:03:37,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027376493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:37,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:37,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:03:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376799304] [2022-07-20 06:03:37,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:37,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:03:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:37,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:03:37,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:03:37,845 INFO L87 Difference]: Start difference. First operand 305 states and 393 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:38,018 INFO L93 Difference]: Finished difference Result 323 states and 414 transitions. [2022-07-20 06:03:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:03:38,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-20 06:03:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:38,019 INFO L225 Difference]: With dead ends: 323 [2022-07-20 06:03:38,019 INFO L226 Difference]: Without dead ends: 323 [2022-07-20 06:03:38,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:03:38,020 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 110 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:38,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 353 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-20 06:03:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 311. [2022-07-20 06:03:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 270 states have internal predecessors, (324), 35 states have call successors, (35), 14 states have call predecessors, (35), 17 states have return successors, (41), 26 states have call predecessors, (41), 35 states have call successors, (41) [2022-07-20 06:03:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 400 transitions. [2022-07-20 06:03:38,038 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 400 transitions. Word has length 30 [2022-07-20 06:03:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:38,038 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 400 transitions. [2022-07-20 06:03:38,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 400 transitions. [2022-07-20 06:03:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:03:38,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:38,039 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] [2022-07-20 06:03:38,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 06:03:38,040 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 453625093, now seen corresponding path program 1 times [2022-07-20 06:03:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:38,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312496869] [2022-07-20 06:03:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:38,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 06:03:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:38,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 06:03:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:38,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:38,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312496869] [2022-07-20 06:03:38,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312496869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:38,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:38,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:03:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136445720] [2022-07-20 06:03:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:38,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:03:38,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:38,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:03:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:38,141 INFO L87 Difference]: Start difference. First operand 311 states and 400 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:38,297 INFO L93 Difference]: Finished difference Result 348 states and 445 transitions. [2022-07-20 06:03:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:38,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-20 06:03:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:38,299 INFO L225 Difference]: With dead ends: 348 [2022-07-20 06:03:38,299 INFO L226 Difference]: Without dead ends: 348 [2022-07-20 06:03:38,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:03:38,299 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 83 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:38,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 365 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-20 06:03:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 330. [2022-07-20 06:03:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 257 states have (on average 1.3307392996108949) internal successors, (342), 286 states have internal predecessors, (342), 39 states have call successors, (39), 14 states have call predecessors, (39), 17 states have return successors, (45), 29 states have call predecessors, (45), 39 states have call successors, (45) [2022-07-20 06:03:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 426 transitions. [2022-07-20 06:03:38,305 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 426 transitions. Word has length 32 [2022-07-20 06:03:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:38,305 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 426 transitions. [2022-07-20 06:03:38,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 426 transitions. [2022-07-20 06:03:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:03:38,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:38,319 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] [2022-07-20 06:03:38,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 06:03:38,319 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1579548114, now seen corresponding path program 1 times [2022-07-20 06:03:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:38,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894433007] [2022-07-20 06:03:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:38,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:03:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:38,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894433007] [2022-07-20 06:03:38,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894433007] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:38,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741408287] [2022-07-20 06:03:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:38,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:38,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:38,644 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:38,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:03:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:38,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 06:03:38,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:38,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:38,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:38,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:38,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:38,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:38,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:38,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:38,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:38,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:38,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:38,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:38,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:39,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:39,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:39,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:39,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:39,227 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:39,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 40 [2022-07-20 06:03:39,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:39,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:39,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:03:39,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:39,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-20 06:03:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:39,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:39,255 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-07-20 06:03:39,260 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)) v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)) v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-07-20 06:03:39,268 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1074 (Array Int Int))) (= (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| 4)) v_ArrVal_1074) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1075) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) is different from false [2022-07-20 06:03:39,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741408287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:39,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:03:39,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-20 06:03:39,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054206489] [2022-07-20 06:03:39,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:39,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 06:03:39,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:39,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 06:03:39,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=323, Unknown=3, NotChecked=114, Total=506 [2022-07-20 06:03:39,279 INFO L87 Difference]: Start difference. First operand 330 states and 426 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:39,932 INFO L93 Difference]: Finished difference Result 384 states and 487 transitions. [2022-07-20 06:03:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:03:39,932 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-07-20 06:03:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:39,933 INFO L225 Difference]: With dead ends: 384 [2022-07-20 06:03:39,933 INFO L226 Difference]: Without dead ends: 384 [2022-07-20 06:03:39,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=757, Unknown=3, NotChecked=180, Total=1122 [2022-07-20 06:03:39,934 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 329 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:39,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 878 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 634 Invalid, 0 Unknown, 84 Unchecked, 0.4s Time] [2022-07-20 06:03:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-07-20 06:03:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 320. [2022-07-20 06:03:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 248 states have (on average 1.3266129032258065) internal successors, (329), 277 states have internal predecessors, (329), 38 states have call successors, (38), 14 states have call predecessors, (38), 17 states have return successors, (44), 28 states have call predecessors, (44), 38 states have call successors, (44) [2022-07-20 06:03:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 411 transitions. [2022-07-20 06:03:39,945 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 411 transitions. Word has length 31 [2022-07-20 06:03:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:39,945 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 411 transitions. [2022-07-20 06:03:39,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:03:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 411 transitions. [2022-07-20 06:03:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:03:39,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:39,946 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:40,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:03:40,163 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,SelfDestructingSolverStorable28 [2022-07-20 06:03:40,163 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-20 06:03:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:40,164 INFO L85 PathProgramCache]: Analyzing trace with hash -575773780, now seen corresponding path program 1 times [2022-07-20 06:03:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:40,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634551928] [2022-07-20 06:03:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:40,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:40,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:40,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634551928] [2022-07-20 06:03:40,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634551928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:40,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872494781] [2022-07-20 06:03:40,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:40,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:40,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:40,494 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:03:40,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:03:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:40,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-20 06:03:40,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:40,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:40,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:03:40,690 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:40,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-07-20 06:03:40,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 06:03:40,705 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:40,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-07-20 06:03:40,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 06:03:40,748 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:40,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-07-20 06:03:40,761 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:40,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 26 [2022-07-20 06:03:40,780 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 06:03:40,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 30 [2022-07-20 06:03:40,797 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 06:03:40,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 30 [2022-07-20 06:03:40,887 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:03:40,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:03:40,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 [2022-07-20 06:03:40,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 [2022-07-20 06:03:41,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 29 [2022-07-20 06:03:41,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 29 [2022-07-20 06:03:41,118 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 06:03:41,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2022-07-20 06:03:41,134 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 06:03:41,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 49 [2022-07-20 06:03:43,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:43,047 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:03:43,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 41 [2022-07-20 06:03:43,053 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:03:43,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-20 06:03:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:43,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:43,593 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:43,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 271 treesize of output 239 [2022-07-20 06:03:43,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:43,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 231 treesize of output 199 [2022-07-20 06:03:45,319 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:03:45,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:04:06,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1194 Int) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse2 (let ((.cse9 (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_4))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0)))) (.cse4 (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_3))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |v_ULTIMATE.start_main_~n~0#1.base_24|)))) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_3 4) 0)) (and (= .cse0 0) (= .cse1 0)) (let ((.cse3 (+ .cse0 4))) (and (= 0 (select (select .cse2 .cse1) .cse3)) (= 0 (select (select .cse4 .cse1) .cse3)))) (not (= (select v_arrayElimArr_4 4) 0)) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2022-07-20 06:04:26,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse2 (let ((.cse9 (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_4))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0)))) (.cse4 (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_3))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |v_ULTIMATE.start_main_~n~0#1.base_24|)))) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_3 4) 0)) (and (= .cse0 0) (= .cse1 0)) (let ((.cse3 (+ .cse0 4))) (and (= 0 (select (select .cse2 .cse1) .cse3)) (= 0 (select (select .cse4 .cse1) .cse3)))) (not (= (select v_arrayElimArr_4 4) 0)) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|)))))) is different from false [2022-07-20 06:04:30,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse8 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_3)) (.cse4 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_4))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 0)) (.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 |v_ULTIMATE.start_main_~n~0#1.base_24|)) (.cse7 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse7)) (.cse6 (select .cse5 .cse7))) (or (let ((.cse3 (+ .cse6 4))) (and (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| .cse1) .cse2) .cse3) 0) (= (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| .cse5) .cse2) .cse3) 0))) (not (= (select v_arrayElimArr_3 4) 0)) (not (= (select v_arrayElimArr_4 4) 0)) (and (= .cse2 0) (= .cse6 0)) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))))) is different from false [2022-07-20 06:04:30,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:30,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 503 treesize of output 413 [2022-07-20 06:04:30,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:30,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:30,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35168 treesize of output 34269 [2022-07-20 06:04:30,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:30,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34206 treesize of output 26396 [2022-07-20 06:04:30,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:30,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:30,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96759 treesize of output 92627 [2022-07-20 06:04:30,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:30,569 INFO L356 Elim1Store]: treesize reduction 21, result has 58.8 percent of original size [2022-07-20 06:04:30,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 123507 treesize of output 113818 [2022-07-20 06:04:32,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:32,822 INFO L356 Elim1Store]: treesize reduction 21, result has 58.8 percent of original size [2022-07-20 06:04:32,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 138253 treesize of output 126966 [2022-07-20 06:04:37,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:37,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:37,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 105946 treesize of output 102891 [2022-07-20 06:04:40,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:40,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:40,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 97538 treesize of output 95923