./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c --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/ldv-memsafety/ArraysOfVariableLength2.c -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 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:51:14,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:51:14,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:51:14,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:51:14,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:51:14,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:51:14,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:51:14,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:51:14,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:51:14,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:51:14,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:51:14,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:51:14,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:51:14,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:51:14,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:51:14,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:51:14,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:51:14,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:51:14,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:51:14,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:51:14,630 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:51:14,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:51:14,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:51:14,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:51:14,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:51:14,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:51:14,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:51:14,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:51:14,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:51:14,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:51:14,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:51:14,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:51:14,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:51:14,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:51:14,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:51:14,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:51:14,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:51:14,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:51:14,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:51:14,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:51:14,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:51:14,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:51:14,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:51:14,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:51:14,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:51:14,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:51:14,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:51:14,690 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:51:14,690 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:51:14,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:51:14,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:51:14,691 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:51:14,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:51:14,692 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:51:14,692 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:51:14,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:51:14,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:51:14,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:51:14,693 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:51:14,693 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:51:14,693 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:51:14,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:51:14,695 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:51:14,695 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:51:14,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:51:14,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:51:14,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:51:14,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:51:14,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:51:14,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:51:14,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:51:14,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:51:14,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:51:14,697 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 -> 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 [2022-07-20 05:51:14,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:51:14,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:51:14,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:51:14,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:51:14,958 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:51:14,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-07-20 05:51:15,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5cc135c/09f4b02a5dd1484ca4fc9f32d3346fe0/FLAG50af48d36 [2022-07-20 05:51:15,395 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:51:15,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-07-20 05:51:15,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5cc135c/09f4b02a5dd1484ca4fc9f32d3346fe0/FLAG50af48d36 [2022-07-20 05:51:15,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5cc135c/09f4b02a5dd1484ca4fc9f32d3346fe0 [2022-07-20 05:51:15,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:51:15,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:51:15,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:51:15,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:51:15,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:51:15,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:51:15" (1/1) ... [2022-07-20 05:51:15,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc29092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:15, skipping insertion in model container [2022-07-20 05:51:15,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:51:15" (1/1) ... [2022-07-20 05:51:15,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:51:15,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:51:15,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:51:15,988 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:51:16,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:51:16,015 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:51:16,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16 WrapperNode [2022-07-20 05:51:16,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:51:16,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:51:16,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:51:16,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:51:16,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,064 INFO L137 Inliner]: procedures = 9, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2022-07-20 05:51:16,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:51:16,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:51:16,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:51:16,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:51:16,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:51:16,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:51:16,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:51:16,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:51:16,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (1/1) ... [2022-07-20 05:51:16,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:51:16,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:16,144 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 05:51:16,172 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 05:51:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:51:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:51:16,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:51:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:51:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:51:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:51:16,256 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:51:16,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:51:16,421 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:51:16,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:51:16,427 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-20 05:51:16,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:51:16 BoogieIcfgContainer [2022-07-20 05:51:16,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:51:16,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:51:16,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:51:16,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:51:16,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:51:15" (1/3) ... [2022-07-20 05:51:16,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9aaf53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:51:16, skipping insertion in model container [2022-07-20 05:51:16,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:51:16" (2/3) ... [2022-07-20 05:51:16,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9aaf53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:51:16, skipping insertion in model container [2022-07-20 05:51:16,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:51:16" (3/3) ... [2022-07-20 05:51:16,461 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2.c [2022-07-20 05:51:16,502 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:51:16,502 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-20 05:51:16,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:51:16,570 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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@574d853, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2186cdfb [2022-07-20 05:51:16,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-20 05:51:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 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 05:51:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 05:51:16,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:16,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 05:51:16,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2022-07-20 05:51:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:16,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953639958] [2022-07-20 05:51:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:16,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:16,831 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 05:51:16,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:16,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953639958] [2022-07-20 05:51:16,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953639958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:51:16,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:51:16,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:51:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660335224] [2022-07-20 05:51:16,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:51:16,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:51:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:16,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:51:16,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:51:16,868 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 05:51:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:16,966 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-20 05:51:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:51:16,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-20 05:51:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:16,979 INFO L225 Difference]: With dead ends: 69 [2022-07-20 05:51:16,979 INFO L226 Difference]: Without dead ends: 65 [2022-07-20 05:51:16,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:51:16,988 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 69 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:16,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-20 05:51:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2022-07-20 05:51:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-07-20 05:51:17,018 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 5 [2022-07-20 05:51:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:17,019 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-07-20 05:51:17,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 05:51:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-07-20 05:51:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:51:17,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:17,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:17,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:51:17,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1809811544, now seen corresponding path program 1 times [2022-07-20 05:51:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:17,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667787337] [2022-07-20 05:51:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:17,096 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 05:51:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:17,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667787337] [2022-07-20 05:51:17,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667787337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:51:17,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:51:17,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:51:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989566355] [2022-07-20 05:51:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:51:17,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:51:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:17,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:51:17,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:51:17,102 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:17,196 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-07-20 05:51:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:51:17,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:51:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:17,198 INFO L225 Difference]: With dead ends: 70 [2022-07-20 05:51:17,198 INFO L226 Difference]: Without dead ends: 70 [2022-07-20 05:51:17,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:51:17,200 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 81 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:17,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 116 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-20 05:51:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2022-07-20 05:51:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.5) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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 05:51:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-07-20 05:51:17,205 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 7 [2022-07-20 05:51:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:17,206 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-07-20 05:51:17,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-07-20 05:51:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:51:17,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:17,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:17,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:51:17,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:17,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash -489510905, now seen corresponding path program 1 times [2022-07-20 05:51:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:17,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131733395] [2022-07-20 05:51:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:17,282 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 05:51:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:17,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131733395] [2022-07-20 05:51:17,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131733395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:51:17,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:51:17,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:51:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436133388] [2022-07-20 05:51:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:51:17,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:51:17,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:17,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:51:17,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:51:17,285 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:17,330 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-07-20 05:51:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:51:17,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:51:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:17,331 INFO L225 Difference]: With dead ends: 75 [2022-07-20 05:51:17,332 INFO L226 Difference]: Without dead ends: 75 [2022-07-20 05:51:17,332 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 05:51:17,333 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 61 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:17,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 152 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:51:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-20 05:51:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2022-07-20 05:51:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 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 05:51:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-07-20 05:51:17,339 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 11 [2022-07-20 05:51:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:17,339 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-07-20 05:51:17,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-07-20 05:51:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:51:17,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:17,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:17,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:51:17,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:17,341 INFO L85 PathProgramCache]: Analyzing trace with hash -489508983, now seen corresponding path program 1 times [2022-07-20 05:51:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:17,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143824996] [2022-07-20 05:51:17,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:17,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:17,427 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 05:51:17,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:17,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143824996] [2022-07-20 05:51:17,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143824996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:51:17,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:51:17,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:51:17,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020891193] [2022-07-20 05:51:17,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:51:17,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:51:17,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:17,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:51:17,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:51:17,430 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:17,456 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-07-20 05:51:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:51:17,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:51:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:17,458 INFO L225 Difference]: With dead ends: 43 [2022-07-20 05:51:17,458 INFO L226 Difference]: Without dead ends: 43 [2022-07-20 05:51:17,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:51:17,459 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:17,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:51:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-20 05:51:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-20 05:51:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.411764705882353) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 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 05:51:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-07-20 05:51:17,465 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2022-07-20 05:51:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:17,465 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-07-20 05:51:17,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-07-20 05:51:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:51:17,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:17,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:17,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:51:17,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:17,467 INFO L85 PathProgramCache]: Analyzing trace with hash -489508982, now seen corresponding path program 1 times [2022-07-20 05:51:17,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:17,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682761967] [2022-07-20 05:51:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:17,551 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 05:51:17,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:17,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682761967] [2022-07-20 05:51:17,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682761967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:51:17,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:51:17,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:51:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885897268] [2022-07-20 05:51:17,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:51:17,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:51:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:17,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:51:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:51:17,555 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:17,618 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-07-20 05:51:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:51:17,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:51:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:17,620 INFO L225 Difference]: With dead ends: 50 [2022-07-20 05:51:17,620 INFO L226 Difference]: Without dead ends: 50 [2022-07-20 05:51:17,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:51:17,622 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:17,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:51:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-20 05:51:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-20 05:51:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.358974358974359) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 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 05:51:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-20 05:51:17,629 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 11 [2022-07-20 05:51:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:17,629 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-20 05:51:17,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-20 05:51:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:51:17,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:17,631 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:17,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:51:17,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1675839934, now seen corresponding path program 1 times [2022-07-20 05:51:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:17,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077072885] [2022-07-20 05:51:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:17,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:17,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:17,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077072885] [2022-07-20 05:51:17,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077072885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:51:17,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:51:17,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:51:17,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468157494] [2022-07-20 05:51:17,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:51:17,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:51:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:51:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:51:17,687 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:17,716 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-07-20 05:51:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:51:17,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:51:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:17,717 INFO L225 Difference]: With dead ends: 47 [2022-07-20 05:51:17,717 INFO L226 Difference]: Without dead ends: 47 [2022-07-20 05:51:17,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:51:17,719 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:17,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:51:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-20 05:51:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-20 05:51:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-07-20 05:51:17,733 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2022-07-20 05:51:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:17,734 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-20 05:51:17,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-07-20 05:51:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:51:17,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:17,735 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:17,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:51:17,735 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1675839933, now seen corresponding path program 1 times [2022-07-20 05:51:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:17,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229977630] [2022-07-20 05:51:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:17,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229977630] [2022-07-20 05:51:17,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229977630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:17,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768874278] [2022-07-20 05:51:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:17,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:17,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:17,881 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 05:51:17,882 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 05:51:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:17,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 05:51:17,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:18,023 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 05:51:18,059 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:51:18,059 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 05:51:18,200 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 05:51:18,286 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:51:18,286 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 05:51:18,342 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:51:18,342 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 05:51:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:18,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:22,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~n#1_3| Int) (v_ArrVal_54 Int)) (or (and (<= 0 |c_ULTIMATE.start_main_~#b~0#1.offset|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_12| Int)) (<= (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4) (select (store |c_#length| |v_ULTIMATE.start_foo_~#a~0#1.base_12| v_ArrVal_54) |c_ULTIMATE.start_main_~#b~0#1.base|)))) (not (<= (* |v_ULTIMATE.start_foo_~n#1_3| 4) v_ArrVal_54)) (< |v_ULTIMATE.start_foo_~n#1_3| (+ |c_ULTIMATE.start_main_~i~2#1| 1)))) is different from false [2022-07-20 05:51:26,529 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 10 treesize of output 8 [2022-07-20 05:51:30,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_13| Int) (|v_ULTIMATE.start_foo_~n#1_3| Int) (v_ArrVal_54 Int) (v_ArrVal_52 Int)) (or (not (<= (* |v_ULTIMATE.start_foo_~n#1_3| 4) v_ArrVal_54)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_13| |c_ULTIMATE.start_main_~#b~0#1.base|) (and (<= 0 |c_ULTIMATE.start_main_~#b~0#1.offset|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_12| Int)) (<= (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_foo_~#a~0#1.base_13| v_ArrVal_52) |v_ULTIMATE.start_foo_~#a~0#1.base_12| v_ArrVal_54) |c_ULTIMATE.start_main_~#b~0#1.base|)))) (< |v_ULTIMATE.start_foo_~n#1_3| (+ |c_ULTIMATE.start_main_~i~2#1| 1)))) is different from false [2022-07-20 05:51:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:51:30,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768874278] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:30,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:30,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 15 [2022-07-20 05:51:30,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243709443] [2022-07-20 05:51:30,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:30,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 05:51:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:30,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 05:51:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=141, Unknown=4, NotChecked=50, Total=240 [2022-07-20 05:51:30,898 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 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 05:51:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:31,489 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2022-07-20 05:51:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:51:31,489 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:51:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:31,492 INFO L225 Difference]: With dead ends: 183 [2022-07-20 05:51:31,492 INFO L226 Difference]: Without dead ends: 183 [2022-07-20 05:51:31,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=183, Invalid=577, Unknown=4, NotChecked=106, Total=870 [2022-07-20 05:51:31,493 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 352 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:31,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 146 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 148 Invalid, 0 Unknown, 389 Unchecked, 0.2s Time] [2022-07-20 05:51:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-20 05:51:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 101. [2022-07-20 05:51:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 100 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2022-07-20 05:51:31,510 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 16 [2022-07-20 05:51:31,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:31,511 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2022-07-20 05:51:31,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 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 05:51:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2022-07-20 05:51:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:51:31,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:31,512 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:31,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 05:51:31,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:31,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:31,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash -411430410, now seen corresponding path program 1 times [2022-07-20 05:51:31,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:31,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045219623] [2022-07-20 05:51:31,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:31,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:31,760 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 05:51:31,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:31,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045219623] [2022-07-20 05:51:31,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045219623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:51:31,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:51:31,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:51:31,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605229668] [2022-07-20 05:51:31,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:51:31,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:51:31,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:31,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:51:31,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:51:31,763 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:31,778 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2022-07-20 05:51:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:51:31,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:51:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:31,779 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:51:31,779 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:51:31,780 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 05:51:31,780 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:31,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:51:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:51:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-20 05:51:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 99 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2022-07-20 05:51:31,787 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 17 [2022-07-20 05:51:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:31,787 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2022-07-20 05:51:31,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2022-07-20 05:51:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:51:31,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:31,788 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:31,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:51:31,789 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:31,789 INFO L85 PathProgramCache]: Analyzing trace with hash -411430409, now seen corresponding path program 1 times [2022-07-20 05:51:31,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:31,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504410045] [2022-07-20 05:51:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:31,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:31,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:31,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504410045] [2022-07-20 05:51:31,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504410045] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:31,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833975325] [2022-07-20 05:51:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:31,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:31,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:31,842 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 05:51:31,871 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 05:51:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:31,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:51:31,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:31,947 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 05:51:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:31,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:32,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833975325] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:32,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:32,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-20 05:51:32,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186395215] [2022-07-20 05:51:32,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:32,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:51:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:32,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:51:32,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:51:32,002 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 05:51:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:32,092 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2022-07-20 05:51:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:51:32,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:51:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:32,093 INFO L225 Difference]: With dead ends: 147 [2022-07-20 05:51:32,094 INFO L226 Difference]: Without dead ends: 147 [2022-07-20 05:51:32,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:51:32,095 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 83 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:32,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 68 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-20 05:51:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 105. [2022-07-20 05:51:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 104 states have internal predecessors, (137), 0 states have call successors, (0), 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 05:51:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 137 transitions. [2022-07-20 05:51:32,101 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 137 transitions. Word has length 17 [2022-07-20 05:51:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:32,101 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 137 transitions. [2022-07-20 05:51:32,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 05:51:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2022-07-20 05:51:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:51:32,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:32,102 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:32,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:32,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-20 05:51:32,303 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 130511665, now seen corresponding path program 1 times [2022-07-20 05:51:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:32,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140706286] [2022-07-20 05:51:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:32,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140706286] [2022-07-20 05:51:32,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140706286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:51:32,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:51:32,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:51:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653628871] [2022-07-20 05:51:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:51:32,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:51:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:32,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:51:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:51:32,339 INFO L87 Difference]: Start difference. First operand 105 states and 137 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:32,364 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2022-07-20 05:51:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:51:32,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 05:51:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:32,366 INFO L225 Difference]: With dead ends: 104 [2022-07-20 05:51:32,366 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 05:51:32,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:51:32,367 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:32,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 53 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:51:32,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 05:51:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-20 05:51:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 103 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2022-07-20 05:51:32,372 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 18 [2022-07-20 05:51:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:32,373 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2022-07-20 05:51:32,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2022-07-20 05:51:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:51:32,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:32,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:32,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:51:32,374 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:32,375 INFO L85 PathProgramCache]: Analyzing trace with hash 130511666, now seen corresponding path program 1 times [2022-07-20 05:51:32,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:32,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829772051] [2022-07-20 05:51:32,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:32,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:32,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829772051] [2022-07-20 05:51:32,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829772051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:32,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8936380] [2022-07-20 05:51:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:32,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:32,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:32,420 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 05:51:32,451 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 05:51:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:32,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:51:32,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:32,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:32,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8936380] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:32,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:32,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-20 05:51:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701442337] [2022-07-20 05:51:32,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:32,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:51:32,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:32,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:51:32,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:51:32,538 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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 05:51:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:32,604 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-07-20 05:51:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:51:32,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 05:51:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:32,605 INFO L225 Difference]: With dead ends: 111 [2022-07-20 05:51:32,605 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 05:51:32,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:51:32,606 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:32,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 96 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:51:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 05:51:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2022-07-20 05:51:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 103 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-07-20 05:51:32,612 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 18 [2022-07-20 05:51:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:32,612 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-07-20 05:51:32,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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 05:51:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-07-20 05:51:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:51:32,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:32,614 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] [2022-07-20 05:51:32,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:32,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:32,836 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash 624099572, now seen corresponding path program 1 times [2022-07-20 05:51:32,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:32,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109230943] [2022-07-20 05:51:32,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:32,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:32,875 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 05:51:32,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:32,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109230943] [2022-07-20 05:51:32,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109230943] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:32,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285725243] [2022-07-20 05:51:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:32,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:32,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:32,877 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 05:51:32,879 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 05:51:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:32,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:51:32,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:32,951 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 05:51:32,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:32,974 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 05:51:32,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285725243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:32,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:32,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-20 05:51:32,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682123215] [2022-07-20 05:51:32,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:32,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:51:32,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:32,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:51:32,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:51:32,979 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 05:51:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:33,011 INFO L93 Difference]: Finished difference Result 168 states and 201 transitions. [2022-07-20 05:51:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:51:33,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:51:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:33,013 INFO L225 Difference]: With dead ends: 168 [2022-07-20 05:51:33,013 INFO L226 Difference]: Without dead ends: 168 [2022-07-20 05:51:33,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:51:33,014 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 151 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:33,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 91 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:51:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-20 05:51:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2022-07-20 05:51:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 159 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 201 transitions. [2022-07-20 05:51:33,022 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 201 transitions. Word has length 20 [2022-07-20 05:51:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:33,022 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 201 transitions. [2022-07-20 05:51:33,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 05:51:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2022-07-20 05:51:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:51:33,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:33,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:33,048 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 05:51:33,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:33,240 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1752050598, now seen corresponding path program 1 times [2022-07-20 05:51:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:33,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61379246] [2022-07-20 05:51:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:33,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:33,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61379246] [2022-07-20 05:51:33,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61379246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:33,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257478431] [2022-07-20 05:51:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:33,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:33,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:33,299 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 05:51:33,326 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 05:51:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:33,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:51:33,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:33,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:33,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257478431] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:33,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:33,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-20 05:51:33,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632426860] [2022-07-20 05:51:33,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:33,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:51:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:33,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:51:33,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:51:33,464 INFO L87 Difference]: Start difference. First operand 160 states and 201 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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 05:51:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:33,581 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-07-20 05:51:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:51:33,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 05:51:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:33,582 INFO L225 Difference]: With dead ends: 160 [2022-07-20 05:51:33,582 INFO L226 Difference]: Without dead ends: 160 [2022-07-20 05:51:33,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:51:33,583 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 112 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:33,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 121 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-20 05:51:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-20 05:51:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 157 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 196 transitions. [2022-07-20 05:51:33,586 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 196 transitions. Word has length 21 [2022-07-20 05:51:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:33,586 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 196 transitions. [2022-07-20 05:51:33,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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 05:51:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-07-20 05:51:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:51:33,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:33,586 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] [2022-07-20 05:51:33,610 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 05:51:33,787 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,SelfDestructingSolverStorable12 [2022-07-20 05:51:33,787 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash -93493367, now seen corresponding path program 1 times [2022-07-20 05:51:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:33,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020929106] [2022-07-20 05:51:33,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:33,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:33,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020929106] [2022-07-20 05:51:33,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020929106] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:33,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391472056] [2022-07-20 05:51:33,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:33,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:33,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:33,855 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 05:51:33,879 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 05:51:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:33,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:51:33,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:33,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:33,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:34,054 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 28 treesize of output 24 [2022-07-20 05:51:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:34,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391472056] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:34,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:34,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-07-20 05:51:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746515408] [2022-07-20 05:51:34,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:34,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:51:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:51:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:51:34,073 INFO L87 Difference]: Start difference. First operand 158 states and 196 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:34,211 INFO L93 Difference]: Finished difference Result 220 states and 264 transitions. [2022-07-20 05:51:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:51:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 05:51:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:34,212 INFO L225 Difference]: With dead ends: 220 [2022-07-20 05:51:34,212 INFO L226 Difference]: Without dead ends: 220 [2022-07-20 05:51:34,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:51:34,214 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:34,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 115 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-20 05:51:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 163. [2022-07-20 05:51:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 157 states have (on average 1.2802547770700636) internal successors, (201), 162 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2022-07-20 05:51:34,218 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 23 [2022-07-20 05:51:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:34,219 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2022-07-20 05:51:34,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2022-07-20 05:51:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:51:34,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:34,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:34,247 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 05:51:34,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:34,435 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:34,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1409452358, now seen corresponding path program 1 times [2022-07-20 05:51:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:34,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791073231] [2022-07-20 05:51:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:34,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791073231] [2022-07-20 05:51:34,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791073231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:34,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067052930] [2022-07-20 05:51:34,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:34,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:34,490 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 05:51:34,490 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 05:51:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:34,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:51:34,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:34,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:34,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067052930] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:34,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:34,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-07-20 05:51:34,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752623590] [2022-07-20 05:51:34,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:34,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:51:34,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:51:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:51:34,626 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:34,715 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2022-07-20 05:51:34,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:51:34,715 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 05:51:34,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:34,716 INFO L225 Difference]: With dead ends: 158 [2022-07-20 05:51:34,716 INFO L226 Difference]: Without dead ends: 158 [2022-07-20 05:51:34,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:51:34,717 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:34,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 106 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-20 05:51:34,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2022-07-20 05:51:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 147 states have internal predecessors, (181), 0 states have call successors, (0), 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 05:51:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2022-07-20 05:51:34,720 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 27 [2022-07-20 05:51:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:34,720 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2022-07-20 05:51:34,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2022-07-20 05:51:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:51:34,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:34,721 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:34,745 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 05:51:34,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:34,932 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1360755252, now seen corresponding path program 1 times [2022-07-20 05:51:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:34,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871394234] [2022-07-20 05:51:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:35,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871394234] [2022-07-20 05:51:35,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871394234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:35,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665914903] [2022-07-20 05:51:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:35,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:35,036 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 05:51:35,038 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 05:51:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:35,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:51:35,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:35,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:35,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665914903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:35,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:35,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 05:51:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107276654] [2022-07-20 05:51:35,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:35,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:51:35,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:35,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:51:35,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:51:35,205 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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 05:51:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:35,341 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2022-07-20 05:51:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:51:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 05:51:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:35,344 INFO L225 Difference]: With dead ends: 150 [2022-07-20 05:51:35,344 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 05:51:35,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:51:35,345 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 168 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:35,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 162 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 05:51:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-07-20 05:51:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 146 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2022-07-20 05:51:35,349 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 27 [2022-07-20 05:51:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:35,349 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2022-07-20 05:51:35,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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 05:51:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2022-07-20 05:51:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:51:35,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:35,351 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, 1, 1, 1] [2022-07-20 05:51:35,376 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 05:51:35,567 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,SelfDestructingSolverStorable15 [2022-07-20 05:51:35,567 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash -144329733, now seen corresponding path program 1 times [2022-07-20 05:51:35,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:35,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818355104] [2022-07-20 05:51:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:51:35,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:35,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818355104] [2022-07-20 05:51:35,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818355104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:35,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157353225] [2022-07-20 05:51:35,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:35,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:35,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:35,697 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 05:51:35,719 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 05:51:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:35,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 05:51:35,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:35,850 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 05:51:35,929 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 05:51:35,929 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 23 treesize of output 18 [2022-07-20 05:51:36,004 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 05:51:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:36,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:43,409 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 14 treesize of output 12 [2022-07-20 05:51:43,411 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 26 treesize of output 24 [2022-07-20 05:51:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:43,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157353225] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:43,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:43,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 15] total 31 [2022-07-20 05:51:43,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760062616] [2022-07-20 05:51:43,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:43,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:51:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:43,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:51:43,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=833, Unknown=3, NotChecked=0, Total=930 [2022-07-20 05:51:43,518 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:44,292 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2022-07-20 05:51:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:51:44,293 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 05:51:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:44,294 INFO L225 Difference]: With dead ends: 127 [2022-07-20 05:51:44,294 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 05:51:44,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=344, Invalid=2203, Unknown=3, NotChecked=0, Total=2550 [2022-07-20 05:51:44,295 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 82 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:44,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 330 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 463 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2022-07-20 05:51:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 05:51:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-20 05:51:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 123 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-07-20 05:51:44,298 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 31 [2022-07-20 05:51:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:44,298 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-07-20 05:51:44,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:44,299 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-07-20 05:51:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 05:51:44,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:44,299 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:44,327 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 05:51:44,523 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,SelfDestructingSolverStorable16 [2022-07-20 05:51:44,524 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2032716941, now seen corresponding path program 1 times [2022-07-20 05:51:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:44,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835463829] [2022-07-20 05:51:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:51:44,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:44,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835463829] [2022-07-20 05:51:44,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835463829] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:44,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001620713] [2022-07-20 05:51:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:44,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:44,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:44,684 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 05:51:44,708 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 05:51:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:44,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 05:51:44,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:44,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:51:44,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-20 05:51:44,955 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:51:44,956 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 05:51:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:51:45,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:45,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:51:45,163 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 25 treesize of output 21 [2022-07-20 05:51:45,169 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:51:45,169 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 05:51:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:51:45,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001620713] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:45,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:45,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-07-20 05:51:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727874874] [2022-07-20 05:51:45,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:45,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:51:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:45,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:51:45,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:51:45,292 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:45,607 INFO L93 Difference]: Finished difference Result 208 states and 248 transitions. [2022-07-20 05:51:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:51:45,608 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-20 05:51:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:45,609 INFO L225 Difference]: With dead ends: 208 [2022-07-20 05:51:45,609 INFO L226 Difference]: Without dead ends: 208 [2022-07-20 05:51:45,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2022-07-20 05:51:45,610 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 159 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:45,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 235 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 241 Invalid, 0 Unknown, 29 Unchecked, 0.2s Time] [2022-07-20 05:51:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-20 05:51:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 99. [2022-07-20 05:51:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1914893617021276) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2022-07-20 05:51:45,613 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 41 [2022-07-20 05:51:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:45,614 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2022-07-20 05:51:45,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-07-20 05:51:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 05:51:45,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:45,615 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:45,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-20 05:51:45,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 05:51:45,827 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1410284307, now seen corresponding path program 1 times [2022-07-20 05:51:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:45,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367173114] [2022-07-20 05:51:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:51:45,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:45,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367173114] [2022-07-20 05:51:45,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367173114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:45,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030379640] [2022-07-20 05:51:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:45,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:45,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:45,921 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:51:45,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 05:51:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:45,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:51:45,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:46,047 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 05:51:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:51:46,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:51:46,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030379640] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:46,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:46,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-20 05:51:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943959578] [2022-07-20 05:51:46,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:46,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:51:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:46,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:51:46,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:51:46,171 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:46,335 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2022-07-20 05:51:46,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:51:46,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 05:51:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:46,336 INFO L225 Difference]: With dead ends: 126 [2022-07-20 05:51:46,336 INFO L226 Difference]: Without dead ends: 126 [2022-07-20 05:51:46,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:51:46,337 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 80 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:46,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 170 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-20 05:51:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2022-07-20 05:51:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.1875) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2022-07-20 05:51:46,339 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 42 [2022-07-20 05:51:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:46,339 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2022-07-20 05:51:46,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-07-20 05:51:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 05:51:46,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:46,339 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:46,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:46,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:46,551 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash 183114832, now seen corresponding path program 2 times [2022-07-20 05:51:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:46,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047294098] [2022-07-20 05:51:46,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:51:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:46,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047294098] [2022-07-20 05:51:46,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047294098] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:46,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533758841] [2022-07-20 05:51:46,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:51:46,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:46,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:46,624 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:51:46,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 05:51:46,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:51:46,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:51:46,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:51:46,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:51:46,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:51:46,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533758841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:46,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:46,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-07-20 05:51:46,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883659308] [2022-07-20 05:51:46,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:46,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:51:46,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:46,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:51:46,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:51:46,887 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 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 05:51:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:47,091 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2022-07-20 05:51:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:51:47,092 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-20 05:51:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:47,093 INFO L225 Difference]: With dead ends: 118 [2022-07-20 05:51:47,093 INFO L226 Difference]: Without dead ends: 118 [2022-07-20 05:51:47,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2022-07-20 05:51:47,094 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 302 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:47,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 170 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-20 05:51:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2022-07-20 05:51:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 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 05:51:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2022-07-20 05:51:47,096 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 46 [2022-07-20 05:51:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:47,096 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2022-07-20 05:51:47,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 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 05:51:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-07-20 05:51:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 05:51:47,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:47,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-20 05:51:47,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:47,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:47,315 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:47,316 INFO L85 PathProgramCache]: Analyzing trace with hash 457132991, now seen corresponding path program 2 times [2022-07-20 05:51:47,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:47,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036434572] [2022-07-20 05:51:47,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:47,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:51:47,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:47,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036434572] [2022-07-20 05:51:47,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036434572] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:47,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299026031] [2022-07-20 05:51:47,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:51:47,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:47,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:47,401 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:51:47,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 05:51:47,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:51:47,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:51:47,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:51:47,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:51:47,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:51:47,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299026031] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:47,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:47,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 05:51:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482790827] [2022-07-20 05:51:47,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:47,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:51:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:47,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:51:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:51:47,619 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:47,733 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-07-20 05:51:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:51:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-20 05:51:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:47,734 INFO L225 Difference]: With dead ends: 101 [2022-07-20 05:51:47,734 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 05:51:47,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:51:47,735 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 79 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:47,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 155 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 05:51:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-07-20 05:51:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-07-20 05:51:47,737 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 47 [2022-07-20 05:51:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:47,738 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-07-20 05:51:47,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-07-20 05:51:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 05:51:47,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:47,738 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-20 05:51:47,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:47,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-20 05:51:47,939 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:47,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:47,939 INFO L85 PathProgramCache]: Analyzing trace with hash -269976254, now seen corresponding path program 3 times [2022-07-20 05:51:47,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:47,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286955056] [2022-07-20 05:51:47,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:47,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:51:48,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:48,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286955056] [2022-07-20 05:51:48,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286955056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:48,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097667666] [2022-07-20 05:51:48,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:51:48,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:48,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:51:48,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 05:51:48,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-20 05:51:48,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:51:48,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 05:51:48,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:48,174 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 05:51:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-20 05:51:48,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-20 05:51:48,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097667666] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:48,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:48,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 17 [2022-07-20 05:51:48,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828465313] [2022-07-20 05:51:48,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:48,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:51:48,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:48,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:51:48,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:51:48,583 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:49,287 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-07-20 05:51:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:51:49,288 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-20 05:51:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:49,289 INFO L225 Difference]: With dead ends: 128 [2022-07-20 05:51:49,289 INFO L226 Difference]: Without dead ends: 128 [2022-07-20 05:51:49,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 05:51:49,290 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 204 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:49,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 208 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:51:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-20 05:51:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2022-07-20 05:51:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 95 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-07-20 05:51:49,293 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 52 [2022-07-20 05:51:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:49,293 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-07-20 05:51:49,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-07-20 05:51:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 05:51:49,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:49,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-20 05:51:49,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:49,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:49,503 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1642790799, now seen corresponding path program 2 times [2022-07-20 05:51:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:49,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304389074] [2022-07-20 05:51:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:49,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 05:51:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:49,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304389074] [2022-07-20 05:51:49,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304389074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:49,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046494789] [2022-07-20 05:51:49,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:51:49,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:49,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:49,584 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:51:49,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 05:51:49,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:51:49,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:51:49,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:51:49,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 05:51:49,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 05:51:49,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046494789] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:49,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:49,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-07-20 05:51:49,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383378887] [2022-07-20 05:51:49,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:49,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:51:49,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:51:49,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:51:49,847 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:49,984 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-07-20 05:51:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:51:49,984 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-07-20 05:51:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:49,985 INFO L225 Difference]: With dead ends: 110 [2022-07-20 05:51:49,985 INFO L226 Difference]: Without dead ends: 110 [2022-07-20 05:51:49,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:51:49,986 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 96 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:49,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 253 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:51:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-20 05:51:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2022-07-20 05:51:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.11) internal successors, (111), 103 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2022-07-20 05:51:49,989 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 56 [2022-07-20 05:51:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:49,989 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2022-07-20 05:51:49,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-07-20 05:51:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 05:51:49,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:49,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-20 05:51:50,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:50,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:50,208 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:50,208 INFO L85 PathProgramCache]: Analyzing trace with hash 74449076, now seen corresponding path program 3 times [2022-07-20 05:51:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:50,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173662070] [2022-07-20 05:51:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 05:51:50,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:50,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173662070] [2022-07-20 05:51:50,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173662070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:50,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111827444] [2022-07-20 05:51:50,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:51:50,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:50,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:50,476 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:51:50,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 05:51:50,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 05:51:50,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:51:50,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-20 05:51:50,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:50,579 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 05:51:50,583 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 05:51:50,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:51:50,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:51:50,620 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:51:50,620 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 05:51:50,713 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:51:50,714 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 05:51:50,832 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 05:51:50,961 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-20 05:51:50,961 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:51:50,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:51:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 05:51:51,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:51,808 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:51:51,809 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 25 treesize of output 24 [2022-07-20 05:51:56,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:51:56,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:51:56,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:51:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 05:51:56,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111827444] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:56,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:56,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 31 [2022-07-20 05:51:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4621212] [2022-07-20 05:51:56,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:56,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 05:51:56,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:56,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 05:51:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2022-07-20 05:51:56,053 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:57,092 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2022-07-20 05:51:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 05:51:57,093 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-20 05:51:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:57,094 INFO L225 Difference]: With dead ends: 169 [2022-07-20 05:51:57,094 INFO L226 Difference]: Without dead ends: 169 [2022-07-20 05:51:57,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 105 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=522, Invalid=1928, Unknown=0, NotChecked=0, Total=2450 [2022-07-20 05:51:57,096 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 229 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:57,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 396 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 293 Unchecked, 0.1s Time] [2022-07-20 05:51:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-20 05:51:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2022-07-20 05:51:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 159 states have (on average 1.1383647798742138) internal successors, (181), 162 states have internal predecessors, (181), 0 states have call successors, (0), 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 05:51:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2022-07-20 05:51:57,099 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 60 [2022-07-20 05:51:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:57,100 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2022-07-20 05:51:57,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2022-07-20 05:51:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-20 05:51:57,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:57,101 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-07-20 05:51:57,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:57,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 05:51:57,318 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:57,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:57,318 INFO L85 PathProgramCache]: Analyzing trace with hash -809246151, now seen corresponding path program 1 times [2022-07-20 05:51:57,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:57,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553140184] [2022-07-20 05:51:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 33 proven. 92 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 05:51:57,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:57,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553140184] [2022-07-20 05:51:57,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553140184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:57,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16370212] [2022-07-20 05:51:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:57,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:57,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:57,491 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:51:57,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 05:51:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:57,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 05:51:57,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:57,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:51:57,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-20 05:51:57,805 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:51:57,805 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 05:51:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 59 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:51:57,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:58,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:51:58,071 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 25 treesize of output 21 [2022-07-20 05:51:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 59 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:51:58,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16370212] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:58,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:58,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-07-20 05:51:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673617430] [2022-07-20 05:51:58,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:58,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 05:51:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:58,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 05:51:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-07-20 05:51:58,289 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 0 states have call successors, (0), 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 05:51:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:58,804 INFO L93 Difference]: Finished difference Result 244 states and 276 transitions. [2022-07-20 05:51:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 05:51:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 0 states have call successors, (0), 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 75 [2022-07-20 05:51:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:58,805 INFO L225 Difference]: With dead ends: 244 [2022-07-20 05:51:58,805 INFO L226 Difference]: Without dead ends: 244 [2022-07-20 05:51:58,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 05:51:58,806 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 279 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:58,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 355 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 349 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2022-07-20 05:51:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-20 05:51:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 175. [2022-07-20 05:51:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 171 states have (on average 1.1461988304093567) internal successors, (196), 174 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2022-07-20 05:51:58,810 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 75 [2022-07-20 05:51:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:58,810 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2022-07-20 05:51:58,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 0 states have call successors, (0), 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 05:51:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2022-07-20 05:51:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 05:51:58,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:58,812 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-07-20 05:51:58,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:59,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:59,035 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:51:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 683173057, now seen corresponding path program 1 times [2022-07-20 05:51:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:51:59,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940656536] [2022-07-20 05:51:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:51:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 88 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:51:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:51:59,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940656536] [2022-07-20 05:51:59,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940656536] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:51:59,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135354871] [2022-07-20 05:51:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:59,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:51:59,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:51:59,152 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:51:59,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 05:51:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:59,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:51:59,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:59,345 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 05:51:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:51:59,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:51:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135354871] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:59,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:51:59,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-20 05:51:59,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300946171] [2022-07-20 05:51:59,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:59,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 05:51:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:51:59,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 05:51:59,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:51:59,553 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:59,808 INFO L93 Difference]: Finished difference Result 223 states and 250 transitions. [2022-07-20 05:51:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:51:59,808 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-07-20 05:51:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:59,809 INFO L225 Difference]: With dead ends: 223 [2022-07-20 05:51:59,809 INFO L226 Difference]: Without dead ends: 223 [2022-07-20 05:51:59,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-07-20 05:51:59,810 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 106 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:59,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 311 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:51:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-20 05:51:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 178. [2022-07-20 05:51:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 174 states have (on average 1.1436781609195403) internal successors, (199), 177 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2022-07-20 05:51:59,814 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 76 [2022-07-20 05:51:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:59,814 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2022-07-20 05:51:59,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2022-07-20 05:51:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-20 05:51:59,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:59,815 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-07-20 05:51:59,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-20 05:52:00,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:52:00,035 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:52:00,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:00,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1737117148, now seen corresponding path program 2 times [2022-07-20 05:52:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:52:00,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130274594] [2022-07-20 05:52:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:52:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 13 proven. 137 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:52:00,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:52:00,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130274594] [2022-07-20 05:52:00,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130274594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:52:00,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355292662] [2022-07-20 05:52:00,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:52:00,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:52:00,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:52:00,152 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:52:00,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 05:52:00,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:52:00,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:52:00,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:52:00,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:52:00,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:52:00,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355292662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:52:00,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:52:00,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-07-20 05:52:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435264947] [2022-07-20 05:52:00,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:52:00,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 05:52:00,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:52:00,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 05:52:00,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:52:00,526 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 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 05:52:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:00,862 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2022-07-20 05:52:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:52:00,863 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 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 80 [2022-07-20 05:52:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:00,864 INFO L225 Difference]: With dead ends: 220 [2022-07-20 05:52:00,864 INFO L226 Difference]: Without dead ends: 220 [2022-07-20 05:52:00,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 05:52:00,865 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 390 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:00,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 247 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:52:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-20 05:52:00,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2022-07-20 05:52:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.127906976744186) internal successors, (194), 175 states have internal predecessors, (194), 0 states have call successors, (0), 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 05:52:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 194 transitions. [2022-07-20 05:52:00,868 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 194 transitions. Word has length 80 [2022-07-20 05:52:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:00,868 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 194 transitions. [2022-07-20 05:52:00,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 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 05:52:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 194 transitions. [2022-07-20 05:52:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-20 05:52:00,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:00,869 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-20 05:52:00,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:01,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:52:01,070 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:52:01,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:01,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2063647327, now seen corresponding path program 4 times [2022-07-20 05:52:01,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:52:01,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316023683] [2022-07-20 05:52:01,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:52:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 05:52:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:52:01,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316023683] [2022-07-20 05:52:01,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316023683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:52:01,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540920886] [2022-07-20 05:52:01,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:52:01,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:52:01,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:52:01,161 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:52:01,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-20 05:52:01,275 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:52:01,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:52:01,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:52:01,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 81 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 05:52:01,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 81 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 05:52:01,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540920886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:52:01,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:52:01,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2022-07-20 05:52:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839759997] [2022-07-20 05:52:01,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:52:01,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 05:52:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:52:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 05:52:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:52:01,519 INFO L87 Difference]: Start difference. First operand 176 states and 194 transitions. Second operand has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:52:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:01,834 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2022-07-20 05:52:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:52:01,835 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-07-20 05:52:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:01,836 INFO L225 Difference]: With dead ends: 197 [2022-07-20 05:52:01,836 INFO L226 Difference]: Without dead ends: 197 [2022-07-20 05:52:01,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2022-07-20 05:52:01,837 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 120 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:01,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 315 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:52:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-20 05:52:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-07-20 05:52:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 184 states have (on average 1.1032608695652173) internal successors, (203), 187 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:52:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2022-07-20 05:52:01,840 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 89 [2022-07-20 05:52:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:01,840 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2022-07-20 05:52:01,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:52:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2022-07-20 05:52:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-20 05:52:01,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:01,841 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-20 05:52:01,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:02,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-20 05:52:02,055 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:52:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:02,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1513850931, now seen corresponding path program 5 times [2022-07-20 05:52:02,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:52:02,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883567528] [2022-07-20 05:52:02,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:02,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:52:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 05:52:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:52:02,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883567528] [2022-07-20 05:52:02,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883567528] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:52:02,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235352753] [2022-07-20 05:52:02,454 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:52:02,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:52:02,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:52:02,456 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:52:02,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-20 05:52:02,679 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-20 05:52:02,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:52:02,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 134 conjunts are in the unsatisfiable core [2022-07-20 05:52:02,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:02,783 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 15 treesize of output 11 [2022-07-20 05:52:02,858 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:52:02,859 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 05:52:02,922 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 21 [2022-07-20 05:52:03,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:03,156 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 28 treesize of output 27 [2022-07-20 05:52:03,258 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:52:03,258 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 05:52:03,353 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 31 treesize of output 31 [2022-07-20 05:52:03,447 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 31 treesize of output 31 [2022-07-20 05:52:03,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:03,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:03,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:03,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 05:52:03,766 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:52:03,766 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 05:52:03,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:52:03,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-07-20 05:52:04,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:04,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:04,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:04,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:52:04,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:04,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 69 [2022-07-20 05:52:04,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:04,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:04,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:04,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2022-07-20 05:52:05,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 25 [2022-07-20 05:52:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 6 proven. 229 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 05:52:05,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:07,356 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:52:07,357 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 05:52:09,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_836))))))) is different from false [2022-07-20 05:52:10,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_836 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))) is different from false [2022-07-20 05:52:12,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) is different from false [2022-07-20 05:52:13,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) is different from false [2022-07-20 05:52:17,690 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:52:17,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:52:17,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_833)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-07-20 05:52:17,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_833 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-07-20 05:52:17,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-07-20 05:52:21,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:52:21,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 635 treesize of output 383 [2022-07-20 05:52:21,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:52:21,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:52:21,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:52:21,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 363 treesize of output 337 [2022-07-20 05:52:21,953 INFO L356 Elim1Store]: treesize reduction 69, result has 5.5 percent of original size [2022-07-20 05:52:21,953 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 6 case distinctions, treesize of input 2169 treesize of output 2055 [2022-07-20 05:52:21,988 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:52:21,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:52:22,953 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 9 proven. 71 refuted. 6 times theorem prover too weak. 10 trivial. 147 not checked. [2022-07-20 05:52:22,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235352753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:52:22,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:52:22,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 41, 41] total 95 [2022-07-20 05:52:22,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167115717] [2022-07-20 05:52:22,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:52:22,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-20 05:52:22,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:52:22,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-20 05:52:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=7232, Unknown=25, NotChecked=1246, Total=8930 [2022-07-20 05:52:22,957 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 0 states have call successors, (0), 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 05:52:24,745 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse8 (+ 392 .cse5)) (.cse9 (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (= (+ (- 1) |c_ULTIMATE.start_main_~i~2#1|) 1) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 8) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= .cse8 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 4)))) (= 400 .cse9) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 1) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (<= .cse8 .cse9)))) is different from false [2022-07-20 05:52:24,750 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse6) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 4)))) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0))) is different from false [2022-07-20 05:52:24,757 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse10 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse11 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 8))) 0) (or .cse11 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse10) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 4)))) (not .cse11) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0))) is different from false [2022-07-20 05:52:24,765 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse10 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse11 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 8))) 0) (or .cse11 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse10) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 4)))) (not .cse11) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-20 05:52:24,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse6) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 4)))) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-20 05:52:24,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse11 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse12 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 8))) 0) (or (<= (+ 392 .cse11) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse12) (<= 1 (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 4)))) (not .cse12) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-20 05:52:24,794 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse11 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 8))) 0) (or (<= (+ 392 .cse11) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 4)))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-20 05:52:26,809 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0) (<= (+ 392 .cse0) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_#res#1|) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_836 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 8))) 0) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 4)))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-20 05:52:28,827 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0) (<= (+ 392 .cse0) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_main_#t~ret6#1|) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 8))) 0) (<= 1 (select .cse1 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse3 (store (select .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse4))) (or (< v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse3) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse3 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_836))))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-20 05:52:28,996 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse6 0) 0) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (not (< |c_ULTIMATE.start_foo_~i~1#1| |c_ULTIMATE.start_foo_~size#1|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse12 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse13 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12) v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12 4) v_ArrVal_836))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse6 8)) (<= 1 (select .cse6 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-20 05:52:29,004 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1))) (< 0 (+ 3 |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~i~1#1|)) (< 0 |c_ULTIMATE.start_main_~i~2#1|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))))) is different from false [2022-07-20 05:52:29,009 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse6 8)) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse12 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse13 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12) v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12 4) v_ArrVal_836))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (<= 1 (select .cse6 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-20 05:52:29,020 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (= |c_ULTIMATE.start_foo_#t~mem3#1| (select .cse0 (+ |c_ULTIMATE.start_foo_~b#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse6) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse6) 0) (<= 2 (select .cse0 8)) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse12 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse13 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12) v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12 4) v_ArrVal_836))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (<= 1 (select .cse0 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-20 05:52:29,034 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* |c_ULTIMATE.start_foo_~i~1#1| 4)) (.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse10 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse11)) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse11)) 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse10 8)) (<= 1 (select .cse10 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse17 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse17) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse17 4) v_ArrVal_836))) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#b~0#1.base| .cse15)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse13 (store (select .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse14))) (or (< v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse13) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse13 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse14)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-20 05:52:29,065 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) is different from false [2022-07-20 05:52:29,080 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse6 (- 4))) 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (or (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse16 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse16) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse16 4) v_ArrVal_836))) (let ((.cse11 (store .cse15 |c_ULTIMATE.start_main_~#b~0#1.base| .cse14)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse12 (store (select .cse11 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse13))) (or (< v_ArrVal_841 (select (select (store .cse11 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse12) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse11 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse12 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse13)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) (< |c_ULTIMATE.start_foo_~i~1#1| |c_ULTIMATE.start_foo_~size#1|)) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse17 8)) (<= 1 (select .cse17 4)) (= (select .cse17 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6 (- 4))) 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-20 05:52:29,094 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse6 (- 4))) 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse7 8)) (<= 1 (select .cse7 4)) (= (select .cse7 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6 (- 4))) 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-20 05:52:29,102 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (select .cse5 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6)) |c_ULTIMATE.start_foo_#t~mem3#1|) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse7) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse6 (- 4))) 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse7) 0) (<= 2 (select .cse5 8)) (<= 1 (select .cse5 4)) (= (select .cse5 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6 (- 4))) 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-20 05:52:29,118 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse8 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse0 (select .cse13 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse8))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse6 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (<= 1 .cse0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse6) (= (select .cse7 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse8 (- 4))) 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse12)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse11))) (or (< v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse10) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse10 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse11)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (<= .cse0 (select .cse7 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse8))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse6) 0) (<= 2 (select .cse13 8)) (= (select .cse13 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse8 (- 4))) 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-20 05:52:29,132 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse7 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse5 (select .cse8 (+ |c_ULTIMATE.start_foo_~b#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse6 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse7) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse8 |c_ULTIMATE.start_foo_~b#1.offset|) 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse12)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse11))) (or (< v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse10) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse10 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse11)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse7) 0) (<= 2 (select .cse8 8)) (<= 1 .cse5) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-20 05:52:29,141 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse7 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse5 (select .cse8 (+ |c_ULTIMATE.start_foo_~b#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse6 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse7) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse8 |c_ULTIMATE.start_foo_~b#1.offset|) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse7) 0) (<= 2 (select .cse8 8)) (<= 1 .cse5) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-20 05:52:29,149 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse7 (select .cse6 4))) (and (= (select .cse6 0) 0) (<= .cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (<= (select .cse6 (* |c_ULTIMATE.start_foo_~i~1#1| 4)) |c_ULTIMATE.start_foo_#t~mem3#1|) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse7) (<= 2 (select .cse6 8)))))) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0))) is different from false [2022-07-20 05:52:29,163 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse13 (select .cse10 4)) (.cse11 (select .cse10 8))) (and (= (select .cse10 0) 0) (<= .cse11 (select .cse12 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 8))) (<= .cse13 (select .cse12 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse13) (<= 2 .cse11))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0))) is different from false [2022-07-20 05:52:31,171 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse7 (select .cse4 4)) (.cse5 (select .cse4 8))) (and (= (select .cse4 0) 0) (<= .cse5 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 8))) (<= .cse7 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse7) (<= 2 .cse5))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-20 05:52:32,806 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0)) is different from false [2022-07-20 05:52:34,305 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= (select .cse8 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_#t~mem1#1|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0))) is different from false [2022-07-20 05:52:36,311 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|)) is different from false [2022-07-20 05:52:38,316 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= (select .cse8 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_#t~mem1#1|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|))) is different from false [2022-07-20 05:52:40,320 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (<= (select .cse4 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_~res~0#1|) (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|))) is different from false [2022-07-20 05:52:42,325 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= 1 (+ (- 1) |c_ULTIMATE.start_bar_~i~0#1|)) (<= (select .cse8 (+ (- 4) (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|))) is different from false [2022-07-20 05:52:44,128 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_bar_~res~0#1|) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_bar_#t~mem1#1|) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-20 05:52:45,658 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 3 |c_ULTIMATE.start_bar_~res~0#1|)) is different from false [2022-07-20 05:52:47,146 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-20 05:52:48,667 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= 3 |c_ULTIMATE.start_bar_#res#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-20 05:52:50,679 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 3 |c_ULTIMATE.start_foo_#t~ret4#1|)) is different from false [2022-07-20 05:52:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:52,661 INFO L93 Difference]: Finished difference Result 321 states and 345 transitions. [2022-07-20 05:52:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-20 05:52:52,662 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 0 states have call successors, (0), 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 98 [2022-07-20 05:52:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:52,663 INFO L225 Difference]: With dead ends: 321 [2022-07-20 05:52:52,663 INFO L226 Difference]: Without dead ends: 321 [2022-07-20 05:52:52,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 157 ConstructedPredicates, 42 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=820, Invalid=12858, Unknown=62, NotChecked=11382, Total=25122 [2022-07-20 05:52:52,667 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 168 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 3417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1633 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:52,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1946 Invalid, 3417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1747 Invalid, 0 Unknown, 1633 Unchecked, 0.9s Time] [2022-07-20 05:52:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-20 05:52:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2022-07-20 05:52:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 269 states have (on average 1.0929368029739777) internal successors, (294), 272 states have internal predecessors, (294), 0 states have call successors, (0), 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 05:52:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 294 transitions. [2022-07-20 05:52:52,672 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 294 transitions. Word has length 98 [2022-07-20 05:52:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:52,672 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 294 transitions. [2022-07-20 05:52:52,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 0 states have call successors, (0), 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 05:52:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 294 transitions. [2022-07-20 05:52:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-20 05:52:52,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:52,673 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1] [2022-07-20 05:52:52,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:52,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 05:52:52,895 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:52:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1090204209, now seen corresponding path program 1 times [2022-07-20 05:52:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:52:52,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814385847] [2022-07-20 05:52:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:52:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 05:52:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:52:53,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814385847] [2022-07-20 05:52:53,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814385847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:52:53,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064437175] [2022-07-20 05:52:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:53,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:52:53,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:52:53,336 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:52:53,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-20 05:52:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:53,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 05:52:53,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:53,508 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 05:52:53,514 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 05:52:53,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:53,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:52:53,553 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:52:53,553 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 05:52:53,645 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:52:53,645 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 05:52:53,662 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:52:53,662 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 05:52:53,847 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:52:53,847 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 05:52:53,859 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:52:53,859 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 05:52:54,077 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:52:54,078 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 05:52:54,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:52:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-20 05:52:54,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:54,475 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:52:54,476 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 05:52:55,396 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:52:55,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:52:56,315 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:52:56,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:52:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-20 05:52:57,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064437175] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:52:57,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:52:57,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 36 [2022-07-20 05:52:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227726011] [2022-07-20 05:52:57,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:52:57,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 05:52:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:52:57,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 05:52:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1107, Unknown=3, NotChecked=0, Total=1332 [2022-07-20 05:52:57,803 INFO L87 Difference]: Start difference. First operand 273 states and 294 transitions. Second operand has 37 states, 36 states have (on average 6.083333333333333) internal successors, (219), 37 states have internal predecessors, (219), 0 states have call successors, (0), 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 05:52:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:58,973 INFO L93 Difference]: Finished difference Result 379 states and 416 transitions. [2022-07-20 05:52:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:52:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 6.083333333333333) internal successors, (219), 37 states have internal predecessors, (219), 0 states have call successors, (0), 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 98 [2022-07-20 05:52:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:58,975 INFO L225 Difference]: With dead ends: 379 [2022-07-20 05:52:58,975 INFO L226 Difference]: Without dead ends: 379 [2022-07-20 05:52:58,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=481, Invalid=2168, Unknown=3, NotChecked=0, Total=2652 [2022-07-20 05:52:58,977 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 175 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:58,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 742 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 462 Invalid, 0 Unknown, 294 Unchecked, 0.2s Time] [2022-07-20 05:52:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-07-20 05:52:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2022-07-20 05:52:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 340 states have (on average 1.1) internal successors, (374), 343 states have internal predecessors, (374), 0 states have call successors, (0), 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 05:52:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 374 transitions. [2022-07-20 05:52:58,982 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 374 transitions. Word has length 98 [2022-07-20 05:52:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:58,982 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 374 transitions. [2022-07-20 05:52:58,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 6.083333333333333) internal successors, (219), 37 states have internal predecessors, (219), 0 states have call successors, (0), 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 05:52:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 374 transitions. [2022-07-20 05:52:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 05:52:58,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:58,984 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:52:59,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:59,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:52:59,199 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:52:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1637321043, now seen corresponding path program 1 times [2022-07-20 05:52:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:52:59,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68544422] [2022-07-20 05:52:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:52:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-20 05:52:59,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:52:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68544422] [2022-07-20 05:52:59,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68544422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:52:59,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298767186] [2022-07-20 05:52:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:59,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:52:59,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:52:59,275 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:52:59,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-20 05:52:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:59,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:52:59,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-20 05:52:59,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-20 05:52:59,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298767186] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:52:59,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:52:59,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-20 05:52:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101697442] [2022-07-20 05:52:59,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:52:59,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:52:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:52:59,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:52:59,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:52:59,631 INFO L87 Difference]: Start difference. First operand 344 states and 374 transitions. Second operand has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 0 states have call successors, (0), 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 05:52:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:59,683 INFO L93 Difference]: Finished difference Result 439 states and 465 transitions. [2022-07-20 05:52:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:52:59,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 0 states have call successors, (0), 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 107 [2022-07-20 05:52:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:59,685 INFO L225 Difference]: With dead ends: 439 [2022-07-20 05:52:59,685 INFO L226 Difference]: Without dead ends: 439 [2022-07-20 05:52:59,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:52:59,686 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 267 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:59,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 225 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:52:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-07-20 05:52:59,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 427. [2022-07-20 05:52:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 423 states have (on average 1.099290780141844) internal successors, (465), 426 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:52:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 465 transitions. [2022-07-20 05:52:59,692 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 465 transitions. Word has length 107 [2022-07-20 05:52:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:59,692 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 465 transitions. [2022-07-20 05:52:59,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 0 states have call successors, (0), 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 05:52:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 465 transitions. [2022-07-20 05:52:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-20 05:52:59,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:59,693 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1] [2022-07-20 05:52:59,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:59,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:52:59,917 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:52:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 141914171, now seen corresponding path program 3 times [2022-07-20 05:52:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:52:59,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717822931] [2022-07-20 05:52:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:52:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 152 proven. 201 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 05:53:00,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:00,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717822931] [2022-07-20 05:53:00,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717822931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:00,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850366471] [2022-07-20 05:53:00,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:53:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:00,161 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:00,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-20 05:53:00,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-20 05:53:00,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:53:00,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 05:53:00,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:00,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:53:00,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:53:00,361 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:00,362 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 05:53:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 137 proven. 3 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-07-20 05:53:00,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 128 proven. 12 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-07-20 05:53:00,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850366471] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:00,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:53:00,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2022-07-20 05:53:00,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455532790] [2022-07-20 05:53:00,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:00,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 05:53:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:53:00,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 05:53:00,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2022-07-20 05:53:00,895 INFO L87 Difference]: Start difference. First operand 427 states and 465 transitions. Second operand has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 24 states have internal predecessors, (147), 0 states have call successors, (0), 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 05:53:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:02,188 INFO L93 Difference]: Finished difference Result 609 states and 668 transitions. [2022-07-20 05:53:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 05:53:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 24 states have internal predecessors, (147), 0 states have call successors, (0), 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 118 [2022-07-20 05:53:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:02,190 INFO L225 Difference]: With dead ends: 609 [2022-07-20 05:53:02,190 INFO L226 Difference]: Without dead ends: 609 [2022-07-20 05:53:02,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=669, Invalid=2301, Unknown=0, NotChecked=0, Total=2970 [2022-07-20 05:53:02,191 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 370 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:02,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 350 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 571 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2022-07-20 05:53:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-07-20 05:53:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 426. [2022-07-20 05:53:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 423 states have (on average 1.0851063829787233) internal successors, (459), 425 states have internal predecessors, (459), 0 states have call successors, (0), 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 05:53:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 459 transitions. [2022-07-20 05:53:02,209 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 459 transitions. Word has length 118 [2022-07-20 05:53:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:02,209 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 459 transitions. [2022-07-20 05:53:02,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 24 states have internal predecessors, (147), 0 states have call successors, (0), 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 05:53:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 459 transitions. [2022-07-20 05:53:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-20 05:53:02,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:02,210 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1] [2022-07-20 05:53:02,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:02,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:02,434 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:53:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash 104371967, now seen corresponding path program 2 times [2022-07-20 05:53:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:53:02,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342246179] [2022-07-20 05:53:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:53:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 159 proven. 194 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-20 05:53:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:02,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342246179] [2022-07-20 05:53:02,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342246179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:02,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13047117] [2022-07-20 05:53:02,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:53:02,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:02,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:02,588 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:02,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-20 05:53:02,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:53:02,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:53:02,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:53:02,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:02,834 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 05:53:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-20 05:53:02,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-20 05:53:03,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13047117] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:03,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:53:03,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2022-07-20 05:53:03,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276982483] [2022-07-20 05:53:03,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:03,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 05:53:03,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:53:03,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 05:53:03,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:53:03,357 INFO L87 Difference]: Start difference. First operand 426 states and 459 transitions. Second operand has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 0 states have call successors, (0), 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 05:53:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:03,945 INFO L93 Difference]: Finished difference Result 569 states and 615 transitions. [2022-07-20 05:53:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:53:03,946 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 0 states have call successors, (0), 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 119 [2022-07-20 05:53:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:03,947 INFO L225 Difference]: With dead ends: 569 [2022-07-20 05:53:03,947 INFO L226 Difference]: Without dead ends: 569 [2022-07-20 05:53:03,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2022-07-20 05:53:03,948 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 120 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:03,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 308 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:53:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-07-20 05:53:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 413. [2022-07-20 05:53:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 411 states have (on average 1.072992700729927) internal successors, (441), 412 states have internal predecessors, (441), 0 states have call successors, (0), 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 05:53:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 441 transitions. [2022-07-20 05:53:03,959 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 441 transitions. Word has length 119 [2022-07-20 05:53:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:03,960 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 441 transitions. [2022-07-20 05:53:03,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 0 states have call successors, (0), 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 05:53:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 441 transitions. [2022-07-20 05:53:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-07-20 05:53:03,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:03,964 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-20 05:53:03,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-07-20 05:53:04,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-20 05:53:04,171 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:53:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:04,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1211272665, now seen corresponding path program 6 times [2022-07-20 05:53:04,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:53:04,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882793467] [2022-07-20 05:53:04,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:04,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:53:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1959 backedges. 933 proven. 87 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2022-07-20 05:53:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:04,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882793467] [2022-07-20 05:53:04,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882793467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:04,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280855208] [2022-07-20 05:53:04,387 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:53:04,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:04,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:04,388 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:04,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-20 05:53:04,846 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-20 05:53:04,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:53:04,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:53:04,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1959 backedges. 1208 proven. 154 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2022-07-20 05:53:05,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1959 backedges. 1240 proven. 122 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2022-07-20 05:53:05,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280855208] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:05,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:53:05,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-07-20 05:53:05,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145200586] [2022-07-20 05:53:05,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:05,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:53:05,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:53:05,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:53:05,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:53:05,246 INFO L87 Difference]: Start difference. First operand 413 states and 441 transitions. Second operand has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:53:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:05,690 INFO L93 Difference]: Finished difference Result 450 states and 476 transitions. [2022-07-20 05:53:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:53:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2022-07-20 05:53:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:05,691 INFO L225 Difference]: With dead ends: 450 [2022-07-20 05:53:05,691 INFO L226 Difference]: Without dead ends: 450 [2022-07-20 05:53:05,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 488 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=1027, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 05:53:05,692 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 169 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:05,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 468 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:53:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-07-20 05:53:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2022-07-20 05:53:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 403 states have (on average 1.0694789081885856) internal successors, (431), 404 states have internal predecessors, (431), 0 states have call successors, (0), 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 05:53:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 431 transitions. [2022-07-20 05:53:05,697 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 431 transitions. Word has length 250 [2022-07-20 05:53:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:05,698 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 431 transitions. [2022-07-20 05:53:05,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:53:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 431 transitions. [2022-07-20 05:53:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-20 05:53:05,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:05,699 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-20 05:53:05,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:05,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-20 05:53:05,923 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:53:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash -981947701, now seen corresponding path program 7 times [2022-07-20 05:53:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:53:05,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394331333] [2022-07-20 05:53:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:53:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1409 proven. 305 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2022-07-20 05:53:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394331333] [2022-07-20 05:53:06,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394331333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370226120] [2022-07-20 05:53:06,160 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:53:06,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:06,162 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:06,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-20 05:53:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:06,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:53:06,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1455 proven. 259 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2022-07-20 05:53:06,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1455 proven. 259 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2022-07-20 05:53:06,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370226120] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:06,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:53:06,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2022-07-20 05:53:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589359387] [2022-07-20 05:53:06,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:06,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:53:06,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:53:06,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:53:06,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:53:06,904 INFO L87 Difference]: Start difference. First operand 405 states and 431 transitions. Second operand has 21 states, 21 states have (on average 7.380952380952381) internal successors, (155), 21 states have internal predecessors, (155), 0 states have call successors, (0), 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 05:53:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:07,222 INFO L93 Difference]: Finished difference Result 447 states and 473 transitions. [2022-07-20 05:53:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:53:07,222 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.380952380952381) internal successors, (155), 21 states have internal predecessors, (155), 0 states have call successors, (0), 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 270 [2022-07-20 05:53:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:07,224 INFO L225 Difference]: With dead ends: 447 [2022-07-20 05:53:07,224 INFO L226 Difference]: Without dead ends: 447 [2022-07-20 05:53:07,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2022-07-20 05:53:07,224 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 122 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:07,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 467 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:53:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-07-20 05:53:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 429. [2022-07-20 05:53:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 427 states have (on average 1.0655737704918034) internal successors, (455), 428 states have internal predecessors, (455), 0 states have call successors, (0), 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 05:53:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 455 transitions. [2022-07-20 05:53:07,230 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 455 transitions. Word has length 270 [2022-07-20 05:53:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:07,231 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 455 transitions. [2022-07-20 05:53:07,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.380952380952381) internal successors, (155), 21 states have internal predecessors, (155), 0 states have call successors, (0), 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 05:53:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 455 transitions. [2022-07-20 05:53:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-07-20 05:53:07,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:07,233 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-20 05:53:07,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:07,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-20 05:53:07,457 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:53:07,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:07,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1423518731, now seen corresponding path program 8 times [2022-07-20 05:53:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:53:07,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369801113] [2022-07-20 05:53:07,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:53:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 1361 proven. 150 refuted. 0 times theorem prover too weak. 1214 trivial. 0 not checked. [2022-07-20 05:53:07,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:07,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369801113] [2022-07-20 05:53:07,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369801113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:07,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631788285] [2022-07-20 05:53:07,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:53:07,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:07,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:07,696 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:07,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-20 05:53:07,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:53:07,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:53:07,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:53:07,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 1865 proven. 269 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-07-20 05:53:08,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 1865 proven. 269 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-07-20 05:53:08,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631788285] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:08,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:53:08,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-07-20 05:53:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914867690] [2022-07-20 05:53:08,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:08,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 05:53:08,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:53:08,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 05:53:08,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-07-20 05:53:08,546 INFO L87 Difference]: Start difference. First operand 429 states and 455 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:53:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:09,168 INFO L93 Difference]: Finished difference Result 474 states and 500 transitions. [2022-07-20 05:53:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 05:53:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2022-07-20 05:53:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:09,169 INFO L225 Difference]: With dead ends: 474 [2022-07-20 05:53:09,169 INFO L226 Difference]: Without dead ends: 474 [2022-07-20 05:53:09,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 562 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=432, Invalid=1638, Unknown=0, NotChecked=0, Total=2070 [2022-07-20 05:53:09,170 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 158 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:09,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 515 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:53:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-20 05:53:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 454. [2022-07-20 05:53:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 452 states have (on average 1.0619469026548674) internal successors, (480), 453 states have internal predecessors, (480), 0 states have call successors, (0), 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 05:53:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 480 transitions. [2022-07-20 05:53:09,176 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 480 transitions. Word has length 286 [2022-07-20 05:53:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:09,176 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 480 transitions. [2022-07-20 05:53:09,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:53:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 480 transitions. [2022-07-20 05:53:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-20 05:53:09,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:09,178 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 22, 22, 22, 22, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-20 05:53:09,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:09,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:09,391 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:53:09,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash 589637946, now seen corresponding path program 9 times [2022-07-20 05:53:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:53:09,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983866508] [2022-07-20 05:53:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:53:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3094 backedges. 1952 proven. 583 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2022-07-20 05:53:09,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:09,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983866508] [2022-07-20 05:53:09,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983866508] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:09,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75236399] [2022-07-20 05:53:09,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:53:09,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:09,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:09,665 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:09,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-20 05:53:10,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 05:53:10,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:53:10,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:53:10,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3094 backedges. 979 proven. 49 refuted. 0 times theorem prover too weak. 2066 trivial. 0 not checked. [2022-07-20 05:53:10,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3094 backedges. 979 proven. 49 refuted. 0 times theorem prover too weak. 2066 trivial. 0 not checked. [2022-07-20 05:53:10,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75236399] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:10,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:53:10,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2022-07-20 05:53:10,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244345362] [2022-07-20 05:53:10,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:10,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 05:53:10,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:53:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 05:53:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-07-20 05:53:10,430 INFO L87 Difference]: Start difference. First operand 454 states and 480 transitions. Second operand has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 0 states have call successors, (0), 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 05:53:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:11,821 INFO L93 Difference]: Finished difference Result 527 states and 556 transitions. [2022-07-20 05:53:11,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-20 05:53:11,822 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 0 states have call successors, (0), 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 301 [2022-07-20 05:53:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:11,823 INFO L225 Difference]: With dead ends: 527 [2022-07-20 05:53:11,823 INFO L226 Difference]: Without dead ends: 527 [2022-07-20 05:53:11,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 586 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1131, Invalid=3425, Unknown=0, NotChecked=0, Total=4556 [2022-07-20 05:53:11,824 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 188 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:11,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 824 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 05:53:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-07-20 05:53:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 484. [2022-07-20 05:53:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 482 states have (on average 1.0601659751037344) internal successors, (511), 483 states have internal predecessors, (511), 0 states have call successors, (0), 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 05:53:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 511 transitions. [2022-07-20 05:53:11,829 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 511 transitions. Word has length 301 [2022-07-20 05:53:11,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:11,830 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 511 transitions. [2022-07-20 05:53:11,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 0 states have call successors, (0), 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 05:53:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 511 transitions. [2022-07-20 05:53:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-07-20 05:53:11,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:11,832 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-20 05:53:11,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:12,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-20 05:53:12,058 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:53:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2049426301, now seen corresponding path program 10 times [2022-07-20 05:53:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:53:12,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337666849] [2022-07-20 05:53:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:53:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3394 backedges. 1780 proven. 228 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2022-07-20 05:53:12,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:12,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337666849] [2022-07-20 05:53:12,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337666849] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:12,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239190789] [2022-07-20 05:53:12,315 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:53:12,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:12,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:12,317 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:12,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-20 05:53:22,650 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:53:22,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:53:22,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:53:22,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3394 backedges. 2422 proven. 617 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-07-20 05:53:23,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3394 backedges. 2422 proven. 617 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-07-20 05:53:23,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239190789] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:23,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:53:23,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 29 [2022-07-20 05:53:23,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196342872] [2022-07-20 05:53:23,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:23,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 05:53:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:53:23,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 05:53:23,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-07-20 05:53:23,437 INFO L87 Difference]: Start difference. First operand 484 states and 511 transitions. Second operand has 29 states, 29 states have (on average 9.310344827586206) internal successors, (270), 29 states have internal predecessors, (270), 0 states have call successors, (0), 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 05:53:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:24,436 INFO L93 Difference]: Finished difference Result 670 states and 705 transitions. [2022-07-20 05:53:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-20 05:53:24,437 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.310344827586206) internal successors, (270), 29 states have internal predecessors, (270), 0 states have call successors, (0), 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 313 [2022-07-20 05:53:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:24,438 INFO L225 Difference]: With dead ends: 670 [2022-07-20 05:53:24,438 INFO L226 Difference]: Without dead ends: 670 [2022-07-20 05:53:24,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 612 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=893, Invalid=3397, Unknown=0, NotChecked=0, Total=4290 [2022-07-20 05:53:24,439 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 178 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:24,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 561 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 05:53:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-07-20 05:53:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 610. [2022-07-20 05:53:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 608 states have (on average 1.055921052631579) internal successors, (642), 609 states have internal predecessors, (642), 0 states have call successors, (0), 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 05:53:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 642 transitions. [2022-07-20 05:53:24,444 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 642 transitions. Word has length 313 [2022-07-20 05:53:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:24,444 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 642 transitions. [2022-07-20 05:53:24,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.310344827586206) internal successors, (270), 29 states have internal predecessors, (270), 0 states have call successors, (0), 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 05:53:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 642 transitions. [2022-07-20 05:53:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2022-07-20 05:53:24,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:24,446 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 28, 28, 25, 25, 25, 25, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-20 05:53:24,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-07-20 05:53:24,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-20 05:53:24,646 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:53:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:24,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2067975502, now seen corresponding path program 11 times [2022-07-20 05:53:24,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:53:24,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9538375] [2022-07-20 05:53:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:53:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 2360 proven. 995 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-20 05:53:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:24,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9538375] [2022-07-20 05:53:24,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9538375] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:24,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119609726] [2022-07-20 05:53:24,964 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:53:24,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:24,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:24,968 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:24,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-20 05:53:30,908 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-20 05:53:30,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:53:30,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 05:53:30,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 2441 proven. 914 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-20 05:53:31,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 2460 proven. 895 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-20 05:53:31,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119609726] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:31,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:53:31,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2022-07-20 05:53:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984515208] [2022-07-20 05:53:31,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:31,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 05:53:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:53:31,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 05:53:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:53:31,645 INFO L87 Difference]: Start difference. First operand 610 states and 642 transitions. Second operand has 30 states, 30 states have (on average 7.433333333333334) internal successors, (223), 30 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:53:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:32,437 INFO L93 Difference]: Finished difference Result 638 states and 670 transitions. [2022-07-20 05:53:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:53:32,437 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.433333333333334) internal successors, (223), 30 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2022-07-20 05:53:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:32,439 INFO L225 Difference]: With dead ends: 638 [2022-07-20 05:53:32,439 INFO L226 Difference]: Without dead ends: 638 [2022-07-20 05:53:32,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 647 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=570, Invalid=1980, Unknown=0, NotChecked=0, Total=2550 [2022-07-20 05:53:32,440 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 181 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:32,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 465 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:53:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-07-20 05:53:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 626. [2022-07-20 05:53:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 624 states have (on average 1.0544871794871795) internal successors, (658), 625 states have internal predecessors, (658), 0 states have call successors, (0), 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 05:53:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 658 transitions. [2022-07-20 05:53:32,450 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 658 transitions. Word has length 328 [2022-07-20 05:53:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:32,451 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 658 transitions. [2022-07-20 05:53:32,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.433333333333334) internal successors, (223), 30 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:53:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 658 transitions. [2022-07-20 05:53:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-07-20 05:53:32,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:32,453 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-20 05:53:32,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:32,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-20 05:53:32,671 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:53:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash -425303788, now seen corresponding path program 12 times [2022-07-20 05:53:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:53:32,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393092570] [2022-07-20 05:53:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:53:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 1991 proven. 1568 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2022-07-20 05:53:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:33,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393092570] [2022-07-20 05:53:33,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393092570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:33,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61665453] [2022-07-20 05:53:33,052 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:53:33,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:33,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:33,056 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:33,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-20 05:53:36,456 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-20 05:53:36,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:53:36,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 05:53:36,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 2080 proven. 474 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2022-07-20 05:53:36,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 2106 proven. 448 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2022-07-20 05:53:37,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61665453] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:37,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:53:37,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 45 [2022-07-20 05:53:37,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274060969] [2022-07-20 05:53:37,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:37,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 05:53:37,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:53:37,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 05:53:37,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1681, Unknown=0, NotChecked=0, Total=1980 [2022-07-20 05:53:37,432 INFO L87 Difference]: Start difference. First operand 626 states and 658 transitions. Second operand has 45 states, 45 states have (on average 6.8) internal successors, (306), 45 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:53:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:39,405 INFO L93 Difference]: Finished difference Result 886 states and 930 transitions. [2022-07-20 05:53:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-20 05:53:39,406 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.8) internal successors, (306), 45 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2022-07-20 05:53:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:39,407 INFO L225 Difference]: With dead ends: 886 [2022-07-20 05:53:39,408 INFO L226 Difference]: Without dead ends: 886 [2022-07-20 05:53:39,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 644 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2486, Invalid=8226, Unknown=0, NotChecked=0, Total=10712 [2022-07-20 05:53:39,408 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 286 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:39,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 699 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 05:53:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-07-20 05:53:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 784. [2022-07-20 05:53:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 782 states have (on average 1.0537084398976981) internal successors, (824), 783 states have internal predecessors, (824), 0 states have call successors, (0), 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 05:53:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 824 transitions. [2022-07-20 05:53:39,417 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 824 transitions. Word has length 336 [2022-07-20 05:53:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:39,417 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 824 transitions. [2022-07-20 05:53:39,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.8) internal successors, (306), 45 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:53:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 824 transitions. [2022-07-20 05:53:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-07-20 05:53:39,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:39,419 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-20 05:53:39,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:39,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-20 05:53:39,633 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:53:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash -297117737, now seen corresponding path program 13 times [2022-07-20 05:53:39,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:53:39,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211170649] [2022-07-20 05:53:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:53:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2022-07-20 05:53:40,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:53:40,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211170649] [2022-07-20 05:53:40,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211170649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:40,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100597164] [2022-07-20 05:53:40,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:53:40,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:53:40,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:53:40,701 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:53:40,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-20 05:53:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:41,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-20 05:53:41,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:41,043 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 05:53:41,049 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 05:53:41,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:53:41,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:41,088 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:41,088 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 05:53:41,165 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:41,166 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 05:53:41,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:41,368 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:53:41,368 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 05:53:41,377 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:41,377 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 05:53:41,599 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:41,600 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 05:53:41,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:41,848 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:41,848 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 05:53:41,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:42,163 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:53:42,163 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 05:53:42,174 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:42,174 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 05:53:42,549 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:53:42,549 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 05:53:42,560 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:42,560 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 05:53:42,946 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:42,946 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 05:53:42,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 0 proven. 3584 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2022-07-20 05:53:43,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:43,697 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:53:43,698 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 05:53:45,211 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:53:45,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:53:47,398 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:53:47,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:53:53,263 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:53:53,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:53:57,426 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:53:57,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:54:03,570 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:54:03,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 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 05:54:06,466 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:54:06,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 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 05:54:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 0 proven. 3573 refuted. 11 times theorem prover too weak. 560 trivial. 0 not checked. [2022-07-20 05:54:12,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100597164] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:54:12,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:54:12,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 24, 22] total 75 [2022-07-20 05:54:12,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352478441] [2022-07-20 05:54:12,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:54:12,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-20 05:54:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:54:12,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-20 05:54:12,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=5034, Unknown=19, NotChecked=0, Total=5700 [2022-07-20 05:54:12,236 INFO L87 Difference]: Start difference. First operand 784 states and 824 transitions. Second operand has 76 states, 75 states have (on average 6.333333333333333) internal successors, (475), 76 states have internal predecessors, (475), 0 states have call successors, (0), 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 05:54:42,332 WARN L233 SmtUtils]: Spent 9.54s on a formula simplification. DAG size of input: 151 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:55:14,996 WARN L233 SmtUtils]: Spent 12.31s on a formula simplification. DAG size of input: 121 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)