./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/prefixsum_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:41:16,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:41:16,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:41:16,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:41:16,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:41:16,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:41:16,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:41:16,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:41:16,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:41:16,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:41:16,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:41:16,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:41:16,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:41:16,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:41:16,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:41:16,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:41:16,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:41:16,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:41:16,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:41:16,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:41:16,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:41:16,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:41:16,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:41:16,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:41:16,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:41:16,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:41:16,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:41:16,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:41:16,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:41:16,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:41:16,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:41:16,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:41:16,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:41:16,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:41:16,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:41:16,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:41:16,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:41:16,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:41:16,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:41:16,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:41:16,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:41:16,395 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 21:41:16,419 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:41:16,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:41:16,422 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:41:16,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:41:16,423 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:41:16,423 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:41:16,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:41:16,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:41:16,424 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:41:16,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:41:16,425 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:41:16,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:41:16,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:41:16,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:41:16,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 21:41:16,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:41:16,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 21:41:16,427 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:41:16,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 21:41:16,427 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:41:16,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 21:41:16,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:41:16,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:41:16,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:41:16,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:41:16,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:41:16,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:41:16,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 21:41:16,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:41:16,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:41:16,429 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:41:16,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 21:41:16,429 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:41:16,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:41:16,430 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:41:16,430 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2023-02-15 21:41:16,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:41:16,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:41:16,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:41:16,667 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:41:16,668 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:41:16,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2023-02-15 21:41:17,701 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:41:17,858 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:41:17,859 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2023-02-15 21:41:17,863 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb0620d2/71b57ebcadfe4121870668f3f62c98c1/FLAG708125039 [2023-02-15 21:41:17,880 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb0620d2/71b57ebcadfe4121870668f3f62c98c1 [2023-02-15 21:41:17,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:41:17,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:41:17,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:41:17,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:41:17,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:41:17,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:41:17" (1/1) ... [2023-02-15 21:41:17,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@187096e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:17, skipping insertion in model container [2023-02-15 21:41:17,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:41:17" (1/1) ... [2023-02-15 21:41:17,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:41:17,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:41:18,011 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2023-02-15 21:41:18,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:41:18,041 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:41:18,051 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2023-02-15 21:41:18,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:41:18,073 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:41:18,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18 WrapperNode [2023-02-15 21:41:18,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:41:18,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:41:18,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:41:18,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:41:18,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,113 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2023-02-15 21:41:18,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:41:18,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:41:18,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:41:18,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:41:18,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,153 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:41:18,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:41:18,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:41:18,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:41:18,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (1/1) ... [2023-02-15 21:41:18,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:41:18,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:41:18,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 21:41:18,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 21:41:18,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:41:18,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 21:41:18,215 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 21:41:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 21:41:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2023-02-15 21:41:18,216 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2023-02-15 21:41:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 21:41:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:41:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2023-02-15 21:41:18,217 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2023-02-15 21:41:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:41:18,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:41:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 21:41:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-02-15 21:41:18,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-02-15 21:41:18,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 21:41:18,303 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:41:18,305 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:41:18,510 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:41:18,515 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:41:18,515 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 21:41:18,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:41:18 BoogieIcfgContainer [2023-02-15 21:41:18,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:41:18,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:41:18,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:41:18,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:41:18,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:41:17" (1/3) ... [2023-02-15 21:41:18,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ba424f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:41:18, skipping insertion in model container [2023-02-15 21:41:18,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18" (2/3) ... [2023-02-15 21:41:18,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ba424f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:41:18, skipping insertion in model container [2023-02-15 21:41:18,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:41:18" (3/3) ... [2023-02-15 21:41:18,524 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2023-02-15 21:41:18,537 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:41:18,538 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 21:41:18,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:41:18,581 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6918a2cd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:41:18,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 21:41:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 21:41:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 21:41:18,593 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:18,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:18,595 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:18,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1639330660, now seen corresponding path program 1 times [2023-02-15 21:41:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:18,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396052972] [2023-02-15 21:41:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:18,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 21:41:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 21:41:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:18,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:41:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:18,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 21:41:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:18,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 21:41:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 21:41:18,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396052972] [2023-02-15 21:41:18,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396052972] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:41:18,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:41:18,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:41:18,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961155117] [2023-02-15 21:41:18,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:41:18,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:41:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:41:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:41:18,998 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:41:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:41:19,119 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2023-02-15 21:41:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:41:19,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2023-02-15 21:41:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:41:19,130 INFO L225 Difference]: With dead ends: 96 [2023-02-15 21:41:19,130 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 21:41:19,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:41:19,139 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:41:19,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:41:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 21:41:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-02-15 21:41:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 21:41:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2023-02-15 21:41:19,185 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 44 [2023-02-15 21:41:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:41:19,186 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2023-02-15 21:41:19,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:41:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2023-02-15 21:41:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 21:41:19,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:19,190 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:19,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 21:41:19,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:19,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:19,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1439199646, now seen corresponding path program 1 times [2023-02-15 21:41:19,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:19,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992794787] [2023-02-15 21:41:19,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:19,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 21:41:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 21:41:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:41:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:19,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 21:41:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:19,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 21:41:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 21:41:19,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:19,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992794787] [2023-02-15 21:41:19,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992794787] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:41:19,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:41:19,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:41:19,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190088523] [2023-02-15 21:41:19,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:41:19,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:41:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:19,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:41:19,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:41:19,555 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:41:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:41:19,741 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2023-02-15 21:41:19,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:41:19,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2023-02-15 21:41:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:41:19,745 INFO L225 Difference]: With dead ends: 59 [2023-02-15 21:41:19,745 INFO L226 Difference]: Without dead ends: 48 [2023-02-15 21:41:19,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:41:19,748 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:41:19,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 185 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:41:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-15 21:41:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-02-15 21:41:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 21:41:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2023-02-15 21:41:19,766 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 44 [2023-02-15 21:41:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:41:19,768 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2023-02-15 21:41:19,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:41:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2023-02-15 21:41:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 21:41:19,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:19,772 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:19,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 21:41:19,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1012024996, now seen corresponding path program 1 times [2023-02-15 21:41:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:19,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039593928] [2023-02-15 21:41:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 21:41:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:20,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 21:41:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:41:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 21:41:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:20,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 21:41:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:41:20,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:20,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039593928] [2023-02-15 21:41:20,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039593928] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:20,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439467628] [2023-02-15 21:41:20,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:20,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:20,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:41:20,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:41:20,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 21:41:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:20,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 21:41:20,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:41:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:41:20,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:41:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:41:20,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439467628] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:41:20,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:41:20,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-02-15 21:41:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418039318] [2023-02-15 21:41:20,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:41:20,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 21:41:20,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:20,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 21:41:20,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:41:20,411 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 21:41:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:41:20,555 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2023-02-15 21:41:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:41:20,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 46 [2023-02-15 21:41:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:41:20,557 INFO L225 Difference]: With dead ends: 73 [2023-02-15 21:41:20,557 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 21:41:20,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-02-15 21:41:20,559 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:41:20,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 244 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:41:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 21:41:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2023-02-15 21:41:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 21:41:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2023-02-15 21:41:20,566 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 46 [2023-02-15 21:41:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:41:20,566 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-02-15 21:41:20,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 21:41:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2023-02-15 21:41:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 21:41:20,568 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:20,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:20,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 21:41:20,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:20,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139546, now seen corresponding path program 2 times [2023-02-15 21:41:20,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:20,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822886539] [2023-02-15 21:41:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:21,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:21,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 21:41:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 21:41:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:22,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:41:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:22,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 21:41:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:22,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 21:41:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:41:22,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:22,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822886539] [2023-02-15 21:41:22,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822886539] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:22,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005663392] [2023-02-15 21:41:22,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:41:22,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:22,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:41:22,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:41:22,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 21:41:22,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:41:22,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:41:22,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 21:41:22,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:41:23,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 21:41:23,090 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_123 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_123) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) (select .cse0 .cse1)))))) is different from true [2023-02-15 21:41:23,154 INFO L321 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2023-02-15 21:41:23,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 30 [2023-02-15 21:41:23,339 INFO L321 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2023-02-15 21:41:23,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 23 [2023-02-15 21:41:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 21:41:23,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:41:23,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005663392] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:23,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:41:23,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 31 [2023-02-15 21:41:23,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515298380] [2023-02-15 21:41:23,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:41:23,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 21:41:23,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 21:41:23,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=952, Unknown=1, NotChecked=62, Total=1122 [2023-02-15 21:41:23,594 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 25 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 21:41:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:41:26,225 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2023-02-15 21:41:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 21:41:26,226 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 25 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 48 [2023-02-15 21:41:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:41:26,228 INFO L225 Difference]: With dead ends: 78 [2023-02-15 21:41:26,228 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 21:41:26,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=332, Invalid=2427, Unknown=1, NotChecked=102, Total=2862 [2023-02-15 21:41:26,230 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 182 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 21:41:26,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 316 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 802 Invalid, 0 Unknown, 74 Unchecked, 0.8s Time] [2023-02-15 21:41:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 21:41:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2023-02-15 21:41:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-15 21:41:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2023-02-15 21:41:26,241 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 48 [2023-02-15 21:41:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:41:26,242 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2023-02-15 21:41:26,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 25 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 21:41:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2023-02-15 21:41:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 21:41:26,243 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:26,243 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:26,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 21:41:26,448 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,SelfDestructingSolverStorable3 [2023-02-15 21:41:26,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:26,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 736701521, now seen corresponding path program 1 times [2023-02-15 21:41:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:26,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226592601] [2023-02-15 21:41:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:26,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:26,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:26,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 21:41:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:26,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 21:41:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:41:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 21:41:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 21:41:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 21:41:26,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:26,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226592601] [2023-02-15 21:41:26,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226592601] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:26,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590094765] [2023-02-15 21:41:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:26,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:41:26,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:41:26,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 21:41:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:26,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-15 21:41:26,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:41:26,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:41:26,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-02-15 21:41:26,963 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:41:26,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 21:41:26,989 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_172 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_172))) is different from true [2023-02-15 21:41:26,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:41:27,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-02-15 21:41:27,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-02-15 21:41:27,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2023-02-15 21:41:27,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2023-02-15 21:41:27,274 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~left Int) (upsweep_~right Int) (upsweep_~a.offset Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ (* upsweep_~right 4) upsweep_~a.offset))) (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) upsweep_~a.offset)) (select .cse0 .cse1)))))) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) is different from true [2023-02-15 21:41:27,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2023-02-15 21:41:27,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2023-02-15 21:41:27,433 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_181 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_181)))) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2023-02-15 21:41:27,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2023-02-15 21:41:27,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 91 [2023-02-15 21:41:27,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:41:27,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 117 [2023-02-15 21:41:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-02-15 21:41:27,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:41:36,142 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 46 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:41:36,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590094765] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:36,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:41:36,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24] total 31 [2023-02-15 21:41:36,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667056360] [2023-02-15 21:41:36,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:41:36,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 21:41:36,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:36,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 21:41:36,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1088, Unknown=4, NotChecked=204, Total=1406 [2023-02-15 21:41:36,146 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 27 states have internal predecessors, (65), 6 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-15 21:41:38,418 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((upsweep_~left Int) (upsweep_~right Int) (upsweep_~a.offset Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ (* upsweep_~right 4) upsweep_~a.offset))) (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) upsweep_~a.offset)) (select .cse0 .cse1)))))) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))) is different from true [2023-02-15 21:41:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:41:38,892 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2023-02-15 21:41:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 21:41:38,893 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 27 states have internal predecessors, (65), 6 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) Word has length 52 [2023-02-15 21:41:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:41:38,896 INFO L225 Difference]: With dead ends: 136 [2023-02-15 21:41:38,896 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 21:41:38,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=527, Invalid=3905, Unknown=6, NotChecked=532, Total=4970 [2023-02-15 21:41:38,899 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 116 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 21:41:38,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 217 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 797 Invalid, 0 Unknown, 350 Unchecked, 0.7s Time] [2023-02-15 21:41:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 21:41:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2023-02-15 21:41:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.11864406779661) internal successors, (66), 60 states have internal predecessors, (66), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (25), 17 states have call predecessors, (25), 16 states have call successors, (25) [2023-02-15 21:41:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2023-02-15 21:41:38,918 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 52 [2023-02-15 21:41:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:41:38,919 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2023-02-15 21:41:38,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 27 states have internal predecessors, (65), 6 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-15 21:41:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2023-02-15 21:41:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 21:41:38,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:38,920 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:38,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 21:41:39,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:39,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash -362686961, now seen corresponding path program 2 times [2023-02-15 21:41:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:39,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171572774] [2023-02-15 21:41:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:39,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:39,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 21:41:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 21:41:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:41:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:39,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 21:41:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 21:41:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 21:41:39,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:39,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171572774] [2023-02-15 21:41:39,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171572774] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:39,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412008635] [2023-02-15 21:41:39,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:41:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:41:39,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:41:39,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 21:41:39,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:41:39,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:41:39,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 21:41:39,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:41:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 21:41:39,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:41:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 21:41:39,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412008635] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:41:39,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:41:39,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2023-02-15 21:41:39,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535988181] [2023-02-15 21:41:39,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:41:39,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 21:41:39,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:39,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 21:41:39,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:41:39,625 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-15 21:41:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:41:39,845 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2023-02-15 21:41:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 21:41:39,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 54 [2023-02-15 21:41:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:41:39,846 INFO L225 Difference]: With dead ends: 108 [2023-02-15 21:41:39,846 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 21:41:39,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-15 21:41:39,848 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:41:39,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 336 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:41:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 21:41:39,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2023-02-15 21:41:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 59 states have internal predecessors, (64), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (22), 15 states have call predecessors, (22), 15 states have call successors, (22) [2023-02-15 21:41:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2023-02-15 21:41:39,864 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 54 [2023-02-15 21:41:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:41:39,865 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2023-02-15 21:41:39,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-15 21:41:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2023-02-15 21:41:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 21:41:39,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:39,866 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:39,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 21:41:40,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:40,073 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958502, now seen corresponding path program 1 times [2023-02-15 21:41:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:40,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981926480] [2023-02-15 21:41:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 21:41:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 21:41:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:41:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 21:41:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-15 21:41:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 21:41:40,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:40,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981926480] [2023-02-15 21:41:40,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981926480] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:40,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207865961] [2023-02-15 21:41:40,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:40,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:41:40,233 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:41:40,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 21:41:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:41:40,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:41:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 21:41:40,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:41:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 21:41:40,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207865961] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:41:40,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:41:40,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-02-15 21:41:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78012123] [2023-02-15 21:41:40,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:41:40,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 21:41:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:40,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 21:41:40,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-02-15 21:41:40,466 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:41:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:41:40,602 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2023-02-15 21:41:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:41:40,603 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2023-02-15 21:41:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:41:40,605 INFO L225 Difference]: With dead ends: 102 [2023-02-15 21:41:40,605 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 21:41:40,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2023-02-15 21:41:40,606 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:41:40,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 279 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:41:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 21:41:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2023-02-15 21:41:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-15 21:41:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2023-02-15 21:41:40,622 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 57 [2023-02-15 21:41:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:41:40,622 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2023-02-15 21:41:40,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:41:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2023-02-15 21:41:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 21:41:40,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:40,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:40,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 21:41:40,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:40,830 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 33191180, now seen corresponding path program 1 times [2023-02-15 21:41:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:40,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216403233] [2023-02-15 21:41:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 21:41:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 21:41:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:41:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 21:41:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:40,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-15 21:41:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:41:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 21:41:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216403233] [2023-02-15 21:41:41,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216403233] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:41,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476453059] [2023-02-15 21:41:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:41,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:41,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:41:41,051 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:41:41,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 21:41:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:41,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:41:41,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:41:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 21:41:41,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:41:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 21:41:41,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476453059] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:41:41,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:41:41,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2023-02-15 21:41:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858890097] [2023-02-15 21:41:41,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:41:41,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 21:41:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:41,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 21:41:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-15 21:41:41,807 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-02-15 21:41:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:41:42,009 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2023-02-15 21:41:42,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:41:42,010 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 59 [2023-02-15 21:41:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:41:42,011 INFO L225 Difference]: With dead ends: 90 [2023-02-15 21:41:42,011 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 21:41:42,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-02-15 21:41:42,012 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:41:42,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 204 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:41:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 21:41:42,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-02-15 21:41:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 15 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2023-02-15 21:41:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2023-02-15 21:41:42,026 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 59 [2023-02-15 21:41:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:41:42,026 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2023-02-15 21:41:42,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-02-15 21:41:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2023-02-15 21:41:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 21:41:42,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:42,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:42,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 21:41:42,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:42,236 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash -94562582, now seen corresponding path program 1 times [2023-02-15 21:41:42,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:42,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072118960] [2023-02-15 21:41:42,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:42,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 21:41:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 21:41:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:41:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 21:41:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 21:41:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-15 21:41:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 21:41:42,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:42,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072118960] [2023-02-15 21:41:42,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072118960] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:42,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099124745] [2023-02-15 21:41:42,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:42,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:42,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:41:42,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:41:42,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 21:41:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:42,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:41:42,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:41:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 21:41:42,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:41:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 21:41:43,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099124745] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:41:43,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:41:43,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2023-02-15 21:41:43,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232388648] [2023-02-15 21:41:43,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:41:43,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 21:41:43,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:43,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 21:41:43,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-15 21:41:43,057 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-02-15 21:41:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:41:43,240 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2023-02-15 21:41:43,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:41:43,241 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 62 [2023-02-15 21:41:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:41:43,242 INFO L225 Difference]: With dead ends: 93 [2023-02-15 21:41:43,242 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 21:41:43,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:41:43,242 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:41:43,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 187 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:41:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 21:41:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-02-15 21:41:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 59 states have internal predecessors, (65), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2023-02-15 21:41:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2023-02-15 21:41:43,261 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 62 [2023-02-15 21:41:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:41:43,261 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2023-02-15 21:41:43,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-02-15 21:41:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2023-02-15 21:41:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 21:41:43,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:41:43,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:41:43,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 21:41:43,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:43,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:41:43,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:41:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1124650442, now seen corresponding path program 1 times [2023-02-15 21:41:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:41:43,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819077018] [2023-02-15 21:41:43,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:43,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:41:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 21:41:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 21:41:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:41:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 21:41:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 21:41:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-15 21:41:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:41:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:41:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-15 21:41:43,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:41:43,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819077018] [2023-02-15 21:41:43,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819077018] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:43,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842956204] [2023-02-15 21:41:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:41:43,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:41:43,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:41:43,901 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:41:43,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 21:41:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:41:44,045 WARN L261 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 179 conjunts are in the unsatisfiable core [2023-02-15 21:41:44,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:41:44,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:41:44,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-02-15 21:41:44,254 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:41:44,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 21:41:44,287 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_488 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_488))) is different from true [2023-02-15 21:41:44,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:41:44,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:41:44,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:41:44,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:41:44,621 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_493 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_493)))) is different from true [2023-02-15 21:41:44,697 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_494 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_494)))) is different from true [2023-02-15 21:41:44,774 WARN L859 $PredicateComparison]: unable to prove that (and (< (+ |c_upsweep_#in~left| 1) |c_upsweep_#in~right|) (exists ((v_ArrVal_496 Int) (v_ArrVal_493 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~left| 4)) v_ArrVal_493) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_496))))) is different from true [2023-02-15 21:41:44,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-15 21:41:44,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2023-02-15 21:41:45,112 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_503 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_503)))) (<= downsweep_~left |c_downsweep_#in~left|) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) is different from true [2023-02-15 21:41:45,399 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_507 Int) (downsweep_~right Int) (v_ArrVal_506 Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~a.offset| downsweep_~a.offset) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ (* downsweep_~right 4) downsweep_~a.offset) v_ArrVal_507) (+ (* downsweep_~left 4) downsweep_~a.offset) v_ArrVal_506))) (<= |c_downsweep_#in~right| downsweep_~right) (<= |c_downsweep_#in~left| downsweep_~left))) is different from true [2023-02-15 21:41:45,743 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse6 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse0 (div (+ (- |c_downsweep_#in~left|) |c_downsweep_#in~right|) 2)) (.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4))) (.cse3 (select .cse5 .cse6)) (.cse10 (= 0 (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2))) (.cse9 (< |c_downsweep_#in~right| |c_downsweep_#in~left|))) (or (exists ((downsweep_~left Int)) (and (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left)) (exists ((v_downsweep_~a.offset_41 Int)) (and (exists ((v_downsweep_~right_41 Int)) (and (exists ((v_downsweep_~left_41 Int) (v_ArrVal_507 Int) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_ArrVal_501 Int)) (and (<= (+ .cse0 v_downsweep_~left_41 1) |c_downsweep_#in~left|) (not (< (+ v_downsweep_~left_41 1) |c_downsweep_#in~left|)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse4 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_41 4)))) (store (let ((.cse1 (store .cse5 .cse6 v_ArrVal_501))) (store .cse1 .cse2 (+ .cse3 (select (store .cse1 .cse2 .cse3) .cse4)))) .cse4 v_ArrVal_503)) (+ (* v_downsweep_~right_41 4) v_downsweep_~a.offset_41) v_ArrVal_507) (+ (* downsweep_~left 4) v_downsweep_~a.offset_41) v_ArrVal_506))))) (<= |c_downsweep_#in~right| v_downsweep_~right_41))) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_41))))) (and (exists ((v_downsweep_~left_41 Int) (downsweep_~left Int) (v_downsweep_~right_41 Int) (v_ArrVal_507 Int) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_downsweep_~a.offset_41 Int) (v_ArrVal_501 Int)) (and (not (< (+ v_downsweep_~left_41 1) |c_downsweep_#in~left|)) (<= (+ .cse0 v_downsweep_~left_41) |c_downsweep_#in~left|) (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse8 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_41 4)))) (store (let ((.cse7 (store .cse5 .cse6 v_ArrVal_501))) (store .cse7 .cse2 (+ .cse3 (select (store .cse7 .cse2 .cse3) .cse8)))) .cse8 v_ArrVal_503)) (+ (* v_downsweep_~right_41 4) v_downsweep_~a.offset_41) v_ArrVal_507) (+ (* downsweep_~left 4) v_downsweep_~a.offset_41) v_ArrVal_506))) (<= |c_downsweep_#in~right| v_downsweep_~right_41) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_41))) (or (not .cse9) .cse10)) (and (exists ((downsweep_~left Int)) (and (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left 1)) (exists ((v_downsweep_~a.offset_41 Int)) (and (exists ((v_downsweep_~right_41 Int)) (and (exists ((v_downsweep_~left_41 Int) (v_ArrVal_507 Int) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_ArrVal_501 Int)) (and (<= (+ .cse0 v_downsweep_~left_41 1) |c_downsweep_#in~left|) (not (< (+ v_downsweep_~left_41 1) |c_downsweep_#in~left|)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse12 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_41 4)))) (store (let ((.cse11 (store .cse5 .cse6 v_ArrVal_501))) (store .cse11 .cse2 (+ .cse3 (select (store .cse11 .cse2 .cse3) .cse12)))) .cse12 v_ArrVal_503)) (+ (* v_downsweep_~right_41 4) v_downsweep_~a.offset_41) v_ArrVal_507) (+ (* downsweep_~left 4) v_downsweep_~a.offset_41) v_ArrVal_506))))) (<= |c_downsweep_#in~right| v_downsweep_~right_41))) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_41))))) (not .cse10) .cse9)))) is different from true [2023-02-15 21:41:46,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 505 treesize of output 509 [2023-02-15 21:41:48,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 199 [2023-02-15 21:41:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 16 not checked. [2023-02-15 21:41:49,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:41:52,768 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (div |c_ULTIMATE.start_main_~n~0#1| 2)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~n~0#1| 4) (- 4)))) (let ((.cse1 (= 0 (mod |c_ULTIMATE.start_main_~n~0#1| 2))) (.cse0 (< |c_ULTIMATE.start_main_~n~0#1| 0)) (.cse6 (select .cse8 .cse9)) (.cse15 (- .cse2)) (.cse16 (* .cse2 4))) (and (or (not .cse0) .cse1 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16)) (.cse3 (div (+ .cse15 |c_ULTIMATE.start_main_~n~0#1| (- 1)) 2)) (.cse12 (= 0 (mod (+ .cse2 |c_ULTIMATE.start_main_~n~0#1| 1) 2)))) (and (forall ((v_downsweep_~right_55 Int)) (or (forall ((v_downsweep_~a.offset_56 Int)) (or (forall ((v_downsweep_~left_57 Int)) (or (< .cse2 (+ .cse3 v_downsweep_~left_57 1)) (not (<= .cse2 (+ v_downsweep_~left_57 1))) (forall ((v_ArrVal_533 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~left_56 Int) (v_ArrVal_534 Int)) (or (< (+ .cse3 v_downsweep_~left_56 1) |c_ULTIMATE.start_main_~n~0#1|) (= 0 (select (store (store (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse4 (store .cse8 .cse9 v_ArrVal_531))) (store .cse4 .cse5 (+ .cse6 (select (store .cse4 .cse5 .cse6) .cse7)))) .cse7 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|))) (or (forall ((v_ArrVal_533 Int) (v_downsweep_~a.offset_56 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~right_55 Int) (v_downsweep_~left_56 Int) (v_downsweep_~left_57 Int) (v_ArrVal_534 Int)) (or (not (<= .cse2 (+ v_downsweep_~left_57 1))) (< (+ .cse3 v_downsweep_~left_56 1) |c_ULTIMATE.start_main_~n~0#1|) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|) (= 0 (select (store (store (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse10 (store .cse8 .cse9 v_ArrVal_531))) (store .cse10 .cse5 (+ .cse6 (select (store .cse10 .cse5 .cse6) .cse11)))) .cse11 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< .cse2 (+ .cse3 v_downsweep_~left_57)) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|))) (not .cse12)) (or (forall ((v_ArrVal_533 Int) (v_downsweep_~a.offset_56 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~right_55 Int) (v_downsweep_~left_56 Int) (v_downsweep_~left_57 Int) (v_ArrVal_534 Int)) (or (< .cse2 (+ .cse3 v_downsweep_~left_57 1)) (not (<= .cse2 (+ v_downsweep_~left_57 1))) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|) (= 0 (select (store (store (let ((.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse13 (store .cse8 .cse9 v_ArrVal_531))) (store .cse13 .cse5 (+ .cse6 (select (store .cse13 .cse5 .cse6) .cse14)))) .cse14 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|) (< (+ .cse3 v_downsweep_~left_56 2) |c_ULTIMATE.start_main_~n~0#1|))) .cse12)))) (or (and (not .cse1) .cse0) (let ((.cse17 (= 0 (mod (+ .cse2 |c_ULTIMATE.start_main_~n~0#1|) 2))) (.cse18 (< |c_ULTIMATE.start_main_~n~0#1| .cse2)) (.cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16 (- 4))) (.cse19 (div (+ .cse15 |c_ULTIMATE.start_main_~n~0#1|) 2))) (and (or .cse17 (not .cse18) (forall ((v_ArrVal_533 Int) (v_downsweep_~a.offset_56 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~right_55 Int) (v_downsweep_~left_56 Int) (v_downsweep_~left_57 Int) (v_ArrVal_534 Int)) (or (< (+ .cse19 v_downsweep_~left_56 2) |c_ULTIMATE.start_main_~n~0#1|) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|) (= 0 (select (store (store (let ((.cse22 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse20 (store .cse8 .cse9 v_ArrVal_531))) (store .cse20 .cse21 (+ (select (store .cse20 .cse21 .cse6) .cse22) .cse6))) .cse22 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|) (not (<= .cse2 (+ v_downsweep_~left_57 2))) (< .cse2 (+ .cse19 v_downsweep_~left_57 2))))) (or (forall ((v_ArrVal_533 Int) (v_downsweep_~a.offset_56 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~right_55 Int) (v_downsweep_~left_56 Int) (v_downsweep_~left_57 Int) (v_ArrVal_534 Int)) (or (< .cse2 (+ .cse19 v_downsweep_~left_57 1)) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|) (= 0 (select (store (store (let ((.cse24 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse23 (store .cse8 .cse9 v_ArrVal_531))) (store .cse23 .cse21 (+ (select (store .cse23 .cse21 .cse6) .cse24) .cse6))) .cse24 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ .cse19 v_downsweep_~left_56 1) |c_ULTIMATE.start_main_~n~0#1|) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|) (not (<= .cse2 (+ v_downsweep_~left_57 2))))) (and (not .cse17) .cse18)) (forall ((v_downsweep_~right_55 Int)) (or (forall ((v_downsweep_~a.offset_56 Int)) (or (forall ((v_downsweep_~left_57 Int)) (or (forall ((v_ArrVal_533 Int) (v_ArrVal_532 Int) (v_ArrVal_531 Int) (v_downsweep_~left_56 Int) (v_ArrVal_534 Int)) (or (= 0 (select (store (store (let ((.cse26 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_57 4)))) (store (let ((.cse25 (store .cse8 .cse9 v_ArrVal_531))) (store .cse25 .cse21 (+ (select (store .cse25 .cse21 .cse6) .cse26) .cse6))) .cse26 v_ArrVal_534)) (+ v_downsweep_~a.offset_56 (* v_downsweep_~right_55 4)) v_ArrVal_532) (+ v_downsweep_~a.offset_56 (* v_downsweep_~left_56 4)) v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ .cse19 v_downsweep_~left_56 1) |c_ULTIMATE.start_main_~n~0#1|))) (not (<= .cse2 (+ v_downsweep_~left_57 2))) (< .cse2 (+ .cse19 v_downsweep_~left_57 2)))) (< v_downsweep_~a.offset_56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ v_downsweep_~right_55 1) |c_ULTIMATE.start_main_~n~0#1|))))))))) is different from false [2023-02-15 21:41:52,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842956204] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:41:52,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:41:52,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 39] total 49 [2023-02-15 21:41:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898502392] [2023-02-15 21:41:52,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:41:52,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 21:41:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:41:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 21:41:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1851, Unknown=15, NotChecked=744, Total=2756 [2023-02-15 21:41:52,780 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 49 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 13 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2023-02-15 21:41:56,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:41:59,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:41:59,401 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)))) (and (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_2| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_2|) 1)) (exists ((v_ArrVal_494 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 .cse1 v_ArrVal_494)))) (exists ((v_ArrVal_493 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 .cse1 v_ArrVal_493)))))) is different from true [2023-02-15 21:42:01,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:42:01,480 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)))) (and (exists ((v_ArrVal_494 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 .cse1 v_ArrVal_494)))) (exists ((v_ArrVal_493 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 .cse1 v_ArrVal_493)))))) is different from true [2023-02-15 21:42:03,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:42:07,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:42:10,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:42:13,652 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse6 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse0 (div (+ (- |c_downsweep_#in~left|) |c_downsweep_#in~right|) 2)) (.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4))) (.cse3 (select .cse5 .cse6)) (.cse10 (= 0 (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2))) (.cse9 (< |c_downsweep_#in~right| |c_downsweep_#in~left|))) (or (exists ((downsweep_~left Int)) (and (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left)) (exists ((v_downsweep_~a.offset_41 Int)) (and (exists ((v_downsweep_~right_41 Int)) (and (exists ((v_downsweep_~left_41 Int) (v_ArrVal_507 Int) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_ArrVal_501 Int)) (and (<= (+ .cse0 v_downsweep_~left_41 1) |c_downsweep_#in~left|) (not (< (+ v_downsweep_~left_41 1) |c_downsweep_#in~left|)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse4 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_41 4)))) (store (let ((.cse1 (store .cse5 .cse6 v_ArrVal_501))) (store .cse1 .cse2 (+ .cse3 (select (store .cse1 .cse2 .cse3) .cse4)))) .cse4 v_ArrVal_503)) (+ (* v_downsweep_~right_41 4) v_downsweep_~a.offset_41) v_ArrVal_507) (+ (* downsweep_~left 4) v_downsweep_~a.offset_41) v_ArrVal_506))))) (<= |c_downsweep_#in~right| v_downsweep_~right_41))) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_41))))) (and (exists ((v_downsweep_~left_41 Int) (downsweep_~left Int) (v_downsweep_~right_41 Int) (v_ArrVal_507 Int) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_downsweep_~a.offset_41 Int) (v_ArrVal_501 Int)) (and (not (< (+ v_downsweep_~left_41 1) |c_downsweep_#in~left|)) (<= (+ .cse0 v_downsweep_~left_41) |c_downsweep_#in~left|) (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse8 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_41 4)))) (store (let ((.cse7 (store .cse5 .cse6 v_ArrVal_501))) (store .cse7 .cse2 (+ .cse3 (select (store .cse7 .cse2 .cse3) .cse8)))) .cse8 v_ArrVal_503)) (+ (* v_downsweep_~right_41 4) v_downsweep_~a.offset_41) v_ArrVal_507) (+ (* downsweep_~left 4) v_downsweep_~a.offset_41) v_ArrVal_506))) (<= |c_downsweep_#in~right| v_downsweep_~right_41) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_41))) (or (not .cse9) .cse10)) (and (exists ((downsweep_~left Int)) (and (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left 1)) (exists ((v_downsweep_~a.offset_41 Int)) (and (exists ((v_downsweep_~right_41 Int)) (and (exists ((v_downsweep_~left_41 Int) (v_ArrVal_507 Int) (v_ArrVal_506 Int) (v_ArrVal_503 Int) (v_ArrVal_501 Int)) (and (<= (+ .cse0 v_downsweep_~left_41 1) |c_downsweep_#in~left|) (not (< (+ v_downsweep_~left_41 1) |c_downsweep_#in~left|)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (let ((.cse12 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_41 4)))) (store (let ((.cse11 (store .cse5 .cse6 v_ArrVal_501))) (store .cse11 .cse2 (+ .cse3 (select (store .cse11 .cse2 .cse3) .cse12)))) .cse12 v_ArrVal_503)) (+ (* v_downsweep_~right_41 4) v_downsweep_~a.offset_41) v_ArrVal_507) (+ (* downsweep_~left 4) v_downsweep_~a.offset_41) v_ArrVal_506))))) (<= |c_downsweep_#in~right| v_downsweep_~right_41))) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_41))))) (not .cse10) .cse9)))) (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_2| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_2|) 1))) is different from true [2023-02-15 21:42:19,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:42:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:42:19,355 INFO L93 Difference]: Finished difference Result 158 states and 235 transitions. [2023-02-15 21:42:19,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-02-15 21:42:19,356 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 13 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) Word has length 72 [2023-02-15 21:42:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:42:19,357 INFO L225 Difference]: With dead ends: 158 [2023-02-15 21:42:19,357 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 21:42:19,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=777, Invalid=7792, Unknown=31, NotChecked=2112, Total=10712 [2023-02-15 21:42:19,360 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 241 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 2035 mSolverCounterSat, 141 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2035 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 956 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2023-02-15 21:42:19,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 456 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2035 Invalid, 18 Unknown, 956 Unchecked, 17.9s Time] [2023-02-15 21:42:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 21:42:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 96. [2023-02-15 21:42:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 70 states have internal predecessors, (77), 19 states have call successors, (19), 4 states have call predecessors, (19), 8 states have return successors, (37), 21 states have call predecessors, (37), 19 states have call successors, (37) [2023-02-15 21:42:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2023-02-15 21:42:19,384 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 72 [2023-02-15 21:42:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:42:19,384 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2023-02-15 21:42:19,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 13 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2023-02-15 21:42:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2023-02-15 21:42:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 21:42:19,386 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:42:19,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:42:19,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 21:42:19,591 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,SelfDestructingSolverStorable9 [2023-02-15 21:42:19,592 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:42:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:42:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1114645218, now seen corresponding path program 1 times [2023-02-15 21:42:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:42:19,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834462238] [2023-02-15 21:42:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:42:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:42:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:42:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 21:42:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 21:42:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:42:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 21:42:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:42:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 21:42:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 21:42:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:42:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:42:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 21:42:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:42:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834462238] [2023-02-15 21:42:19,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834462238] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:42:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81479339] [2023-02-15 21:42:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:42:19,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:42:19,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:42:19,815 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:42:19,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 21:42:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:19,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 21:42:19,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:42:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 21:42:20,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:42:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 21:42:20,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81479339] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:42:20,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:42:20,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2023-02-15 21:42:20,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269160842] [2023-02-15 21:42:20,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:42:20,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 21:42:20,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:42:20,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 21:42:20,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:42:20,323 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 7 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2023-02-15 21:42:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:42:20,478 INFO L93 Difference]: Finished difference Result 109 states and 152 transitions. [2023-02-15 21:42:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 21:42:20,479 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 7 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 71 [2023-02-15 21:42:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:42:20,480 INFO L225 Difference]: With dead ends: 109 [2023-02-15 21:42:20,480 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 21:42:20,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-02-15 21:42:20,481 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:42:20,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 269 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:42:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 21:42:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-15 21:42:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 62 states have internal predecessors, (67), 17 states have call successors, (17), 4 states have call predecessors, (17), 8 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2023-02-15 21:42:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2023-02-15 21:42:20,497 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 71 [2023-02-15 21:42:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:42:20,497 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2023-02-15 21:42:20,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 7 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2023-02-15 21:42:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2023-02-15 21:42:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-15 21:42:20,499 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:42:20,499 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:42:20,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 21:42:20,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:42:20,705 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:42:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:42:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1763257480, now seen corresponding path program 2 times [2023-02-15 21:42:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:42:20,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909130939] [2023-02-15 21:42:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:42:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:42:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:42:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 21:42:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 21:42:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 21:42:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 21:42:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:42:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 21:42:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 21:42:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:42:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:42:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:42:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 21:42:22,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:42:22,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909130939] [2023-02-15 21:42:22,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909130939] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:42:22,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363196784] [2023-02-15 21:42:22,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:42:22,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:42:22,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:42:22,823 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:42:22,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 21:42:22,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:42:22,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:42:22,971 WARN L261 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 181 conjunts are in the unsatisfiable core [2023-02-15 21:42:22,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:42:23,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:42:23,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-02-15 21:42:23,204 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:42:23,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 21:42:23,248 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_707 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_707))) is different from true [2023-02-15 21:42:23,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:42:23,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:42:23,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:42:23,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:42:23,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:42:23,679 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_713 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_713)))) is different from true [2023-02-15 21:42:23,758 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_714 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_714)))) is different from true [2023-02-15 21:42:23,839 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (v_ArrVal_716 Int) (v_ArrVal_713 Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~left| 4)) v_ArrVal_713) (+ (* upsweep_~right 4) |c_upsweep_#in~a.offset|) v_ArrVal_716))))) is different from true [2023-02-15 21:42:23,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-02-15 21:42:25,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2023-02-15 21:42:25,381 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_725 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_725) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))))) is different from true [2023-02-15 21:42:25,535 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_728 Int) (v_ArrVal_727 Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (not (< (+ |c_downsweep_#in~left| 1) downsweep_~right)) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset) (<= |c_downsweep_#in~right| downsweep_~right) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ (* downsweep_~right 4) downsweep_~a.offset) v_ArrVal_728) (+ (* |c_downsweep_#in~left| 4) downsweep_~a.offset) v_ArrVal_727))))) is different from true [2023-02-15 21:42:25,646 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_downsweep_#in~right| 4))) (let ((.cse6 (div (+ (- |c_downsweep_#in~left|) |c_downsweep_#in~right|) 2)) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| .cse5))) (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4))) (.cse3 (select .cse0 .cse1)) (.cse4 (* .cse6 (- 4))) (.cse8 (= 0 (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2))) (.cse7 (< |c_downsweep_#in~right| |c_downsweep_#in~left|))) (or (and (exists ((v_downsweep_~left_73 Int) (v_ArrVal_728 Int) (v_ArrVal_727 Int) (v_downsweep_~a.offset_72 Int) (v_ArrVal_725 Int) (v_downsweep_~right_71 Int) (v_ArrVal_721 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (store (store (store .cse0 .cse1 v_ArrVal_721) .cse2 v_ArrVal_725) (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_73 4)) .cse3) (+ (* v_downsweep_~right_71 4) v_downsweep_~a.offset_72) v_ArrVal_728) (+ .cse4 v_downsweep_~a.offset_72 .cse5) v_ArrVal_727))) (<= |c_downsweep_#in~right| v_downsweep_~right_71) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_72) (not (< (+ |c_downsweep_#in~right| 1) (+ .cse6 v_downsweep_~right_71))))) (or (not .cse7) .cse8)) (and (exists ((v_downsweep_~left_73 Int) (v_ArrVal_728 Int) (v_ArrVal_727 Int) (v_downsweep_~right_71 Int) (v_downsweep_~a.offset_72 Int) (v_ArrVal_725 Int) (v_ArrVal_721 Int)) (and (<= |c_downsweep_#in~right| v_downsweep_~right_71) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (store (store (store .cse0 .cse1 v_ArrVal_721) .cse2 v_ArrVal_725) (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_73 4)) .cse3) (+ (* v_downsweep_~right_71 4) v_downsweep_~a.offset_72) v_ArrVal_728) (+ .cse4 v_downsweep_~a.offset_72 .cse5 (- 4)) v_ArrVal_727))) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_72) (not (< |c_downsweep_#in~right| (+ .cse6 v_downsweep_~right_71))))) (not .cse8) .cse7))))) is different from true [2023-02-15 21:42:25,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 248 [2023-02-15 21:42:25,822 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 21:42:26,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2023-02-15 21:42:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 16 not checked. [2023-02-15 21:42:26,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:42:27,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363196784] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:42:27,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:42:27,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 36] total 57 [2023-02-15 21:42:27,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747424519] [2023-02-15 21:42:27,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:42:27,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-02-15 21:42:27,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:42:27,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-15 21:42:27,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2575, Unknown=8, NotChecked=756, Total=3540 [2023-02-15 21:42:27,247 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 57 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 47 states have internal predecessors, (88), 16 states have call successors, (19), 3 states have call predecessors, (19), 13 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-02-15 21:42:41,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:42:42,881 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_downsweep_#in~right| 4))) (let ((.cse1 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse2 (+ |c_downsweep_#in~a.offset| .cse5))) (let ((.cse0 (select .cse1 .cse2))) (and (or (not (= 0 .cse0)) (<= 4 |c_downsweep_#in~right|) (<= |c_downsweep_#in~right| 1) (<= 1 |c_downsweep_#in~a.offset|) (<= (+ |c_downsweep_#in~a.offset| (* 6 |c_downsweep_#in~left|) 1) (* 2 |c_downsweep_#in~right|)) (= .cse0 (select (select |c_#memory_int| |c_downsweep_#in~a.base|) 0))) (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_3| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_3|) 1)) (let ((.cse6 (div (+ (- |c_downsweep_#in~left|) |c_downsweep_#in~right|) 2))) (let ((.cse3 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4))) (.cse4 (* .cse6 (- 4))) (.cse8 (= 0 (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2))) (.cse7 (< |c_downsweep_#in~right| |c_downsweep_#in~left|))) (or (and (exists ((v_downsweep_~left_73 Int) (v_ArrVal_728 Int) (v_ArrVal_727 Int) (v_downsweep_~a.offset_72 Int) (v_ArrVal_725 Int) (v_downsweep_~right_71 Int) (v_ArrVal_721 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (store (store (store .cse1 .cse2 v_ArrVal_721) .cse3 v_ArrVal_725) (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_73 4)) .cse0) (+ (* v_downsweep_~right_71 4) v_downsweep_~a.offset_72) v_ArrVal_728) (+ .cse4 v_downsweep_~a.offset_72 .cse5) v_ArrVal_727))) (<= |c_downsweep_#in~right| v_downsweep_~right_71) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_72) (not (< (+ |c_downsweep_#in~right| 1) (+ .cse6 v_downsweep_~right_71))))) (or (not .cse7) .cse8)) (and (exists ((v_downsweep_~left_73 Int) (v_ArrVal_728 Int) (v_ArrVal_727 Int) (v_downsweep_~right_71 Int) (v_downsweep_~a.offset_72 Int) (v_ArrVal_725 Int) (v_ArrVal_721 Int)) (and (<= |c_downsweep_#in~right| v_downsweep_~right_71) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (store (store (store .cse1 .cse2 v_ArrVal_721) .cse3 v_ArrVal_725) (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_73 4)) .cse0) (+ (* v_downsweep_~right_71 4) v_downsweep_~a.offset_72) v_ArrVal_728) (+ .cse4 v_downsweep_~a.offset_72 .cse5 (- 4)) v_ArrVal_727))) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_72) (not (< |c_downsweep_#in~right| (+ .cse6 v_downsweep_~right_71))))) (not .cse8) .cse7)))))))) is different from true [2023-02-15 21:42:51,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:43:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:43:08,737 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2023-02-15 21:43:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-02-15 21:43:08,738 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 47 states have internal predecessors, (88), 16 states have call successors, (19), 3 states have call predecessors, (19), 13 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) Word has length 74 [2023-02-15 21:43:08,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:43:08,740 INFO L225 Difference]: With dead ends: 158 [2023-02-15 21:43:08,741 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 21:43:08,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3021 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=1007, Invalid=10560, Unknown=21, NotChecked=1752, Total=13340 [2023-02-15 21:43:08,746 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 375 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 176 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 3234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 916 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2023-02-15 21:43:08,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 524 Invalid, 3234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2134 Invalid, 8 Unknown, 916 Unchecked, 11.7s Time] [2023-02-15 21:43:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 21:43:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 88. [2023-02-15 21:43:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 64 states have internal predecessors, (70), 17 states have call successors, (17), 4 states have call predecessors, (17), 8 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2023-02-15 21:43:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2023-02-15 21:43:08,774 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 74 [2023-02-15 21:43:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:43:08,774 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2023-02-15 21:43:08,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 47 states have internal predecessors, (88), 16 states have call successors, (19), 3 states have call predecessors, (19), 13 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-02-15 21:43:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2023-02-15 21:43:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-15 21:43:08,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:43:08,776 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:43:08,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 21:43:08,982 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,SelfDestructingSolverStorable11 [2023-02-15 21:43:08,982 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:43:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:43:08,983 INFO L85 PathProgramCache]: Analyzing trace with hash 844735882, now seen corresponding path program 2 times [2023-02-15 21:43:08,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:43:08,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615268804] [2023-02-15 21:43:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:43:08,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:43:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 21:43:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 21:43:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:43:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 21:43:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 21:43:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 21:43:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-02-15 21:43:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:43:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-15 21:43:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:43:09,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615268804] [2023-02-15 21:43:09,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615268804] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:43:09,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820914499] [2023-02-15 21:43:09,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:43:09,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:43:09,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:43:09,257 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:43:09,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 21:43:09,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:43:09,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:43:09,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:43:09,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:43:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-15 21:43:09,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:43:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-15 21:43:09,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820914499] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:43:09,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:43:09,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2023-02-15 21:43:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579884158] [2023-02-15 21:43:09,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:43:09,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 21:43:09,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:43:09,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 21:43:09,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:43:09,853 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-15 21:43:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:43:09,994 INFO L93 Difference]: Finished difference Result 132 states and 190 transitions. [2023-02-15 21:43:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:43:09,995 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 85 [2023-02-15 21:43:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:43:09,996 INFO L225 Difference]: With dead ends: 132 [2023-02-15 21:43:09,996 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 21:43:09,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 186 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:43:09,997 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 26 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:43:09,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 264 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:43:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 21:43:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2023-02-15 21:43:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.125) internal successors, (72), 65 states have internal predecessors, (72), 17 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (31), 19 states have call predecessors, (31), 17 states have call successors, (31) [2023-02-15 21:43:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2023-02-15 21:43:10,015 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 85 [2023-02-15 21:43:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:43:10,015 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2023-02-15 21:43:10,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-15 21:43:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2023-02-15 21:43:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-15 21:43:10,017 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:43:10,017 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:43:10,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 21:43:10,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 21:43:10,223 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:43:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:43:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 440692874, now seen corresponding path program 3 times [2023-02-15 21:43:10,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:43:10,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243573215] [2023-02-15 21:43:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:43:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:43:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 21:43:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 21:43:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 21:43:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 21:43:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 21:43:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 21:43:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-02-15 21:43:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:43:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-15 21:43:10,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:43:10,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243573215] [2023-02-15 21:43:10,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243573215] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:43:10,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511441032] [2023-02-15 21:43:10,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 21:43:10,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:43:10,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:43:10,497 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:43:10,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 21:43:10,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 21:43:10,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:43:10,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 119 conjunts are in the unsatisfiable core [2023-02-15 21:43:10,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:43:11,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 21:43:11,737 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_971 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_971) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) (select .cse0 .cse1)))))) is different from true [2023-02-15 21:43:11,882 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_973 Int) (downsweep_~right Int) (downsweep_~a.offset Int) (v_ArrVal_975 Int)) (and (not (< (+ |c_downsweep_#in~left| 1) downsweep_~right)) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset) (<= |c_downsweep_#in~right| downsweep_~right) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ (* downsweep_~right 4) downsweep_~a.offset) v_ArrVal_973) (+ (* |c_downsweep_#in~left| 4) downsweep_~a.offset) v_ArrVal_975))))) is different from true [2023-02-15 21:43:11,926 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_973 Int) (v_ArrVal_971 Int) (v_downsweep_~a.offset_103 Int) (v_ArrVal_969 Int) (v_downsweep_~right_101 Int) (v_ArrVal_975 Int)) (let ((.cse5 (div (+ (- |c_downsweep_#in~left|) |c_downsweep_#in~right|) 2))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse3 (* .cse5 (- 4))) (.cse4 (* |c_downsweep_#in~right| 4))) (store (store (let ((.cse2 (* |c_downsweep_#in~left| 4)) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| .cse4))) (store (store (store .cse0 .cse1 v_ArrVal_969) (+ |c_downsweep_#in~a.offset| .cse2) v_ArrVal_971) (+ |c_downsweep_#in~a.offset| .cse2 .cse3) (select .cse0 .cse1))) (+ v_downsweep_~a.offset_103 (* v_downsweep_~right_101 4)) v_ArrVal_973) (+ .cse3 v_downsweep_~a.offset_103 .cse4) v_ArrVal_975)))) (<= |c_downsweep_#in~a.offset| v_downsweep_~a.offset_103) (not (< (+ |c_downsweep_#in~right| 1) (+ .cse5 v_downsweep_~right_101))) (<= |c_downsweep_#in~right| v_downsweep_~right_101)))) (< (+ |c_downsweep_#in~left| 1) |c_downsweep_#in~right|)) is different from true [2023-02-15 21:43:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 8 not checked. [2023-02-15 21:43:11,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:43:12,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511441032] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:43:12,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:43:12,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 25 [2023-02-15 21:43:12,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181619760] [2023-02-15 21:43:12,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:43:12,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 21:43:12,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:43:12,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 21:43:12,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=588, Unknown=3, NotChecked=150, Total=812 [2023-02-15 21:43:12,738 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand has 25 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 9 states have call successors, (21), 2 states have call predecessors, (21), 8 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2023-02-15 21:43:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:43:13,974 INFO L93 Difference]: Finished difference Result 167 states and 242 transitions. [2023-02-15 21:43:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 21:43:13,974 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 9 states have call successors, (21), 2 states have call predecessors, (21), 8 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) Word has length 85 [2023-02-15 21:43:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:43:13,975 INFO L225 Difference]: With dead ends: 167 [2023-02-15 21:43:13,976 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 21:43:13,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=150, Invalid=1341, Unknown=3, NotChecked=228, Total=1722 [2023-02-15 21:43:13,977 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 21:43:13,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 337 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 862 Invalid, 1 Unknown, 298 Unchecked, 0.7s Time] [2023-02-15 21:43:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 21:43:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2023-02-15 21:43:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 67 states have internal predecessors, (75), 17 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (30), 19 states have call predecessors, (30), 17 states have call successors, (30) [2023-02-15 21:43:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2023-02-15 21:43:13,997 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 85 [2023-02-15 21:43:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:43:13,997 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2023-02-15 21:43:13,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 9 states have call successors, (21), 2 states have call predecessors, (21), 8 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2023-02-15 21:43:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2023-02-15 21:43:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-15 21:43:13,998 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:43:13,999 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:43:14,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 21:43:14,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 21:43:14,206 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:43:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:43:14,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1807452182, now seen corresponding path program 4 times [2023-02-15 21:43:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:43:14,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839678423] [2023-02-15 21:43:14,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:43:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:43:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 21:43:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 21:43:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 21:43:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 21:43:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 21:43:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 21:43:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:43:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:43:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-15 21:43:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:43:14,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839678423] [2023-02-15 21:43:14,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839678423] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:43:14,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896831890] [2023-02-15 21:43:14,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 21:43:14,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:43:14,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:43:14,709 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:43:14,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 21:43:14,854 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 21:43:14,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:43:14,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:43:14,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:43:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-02-15 21:43:14,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:43:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-02-15 21:43:15,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896831890] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:43:15,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:43:15,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 22 [2023-02-15 21:43:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745012899] [2023-02-15 21:43:15,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:43:15,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 21:43:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:43:15,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 21:43:15,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2023-02-15 21:43:15,301 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 22 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2023-02-15 21:43:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:43:15,750 INFO L93 Difference]: Finished difference Result 132 states and 187 transitions. [2023-02-15 21:43:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 21:43:15,750 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 84 [2023-02-15 21:43:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:43:15,751 INFO L225 Difference]: With dead ends: 132 [2023-02-15 21:43:15,751 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 21:43:15,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2023-02-15 21:43:15,752 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:43:15,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 692 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:43:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 21:43:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2023-02-15 21:43:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 72 states have internal predecessors, (81), 20 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (34), 21 states have call predecessors, (34), 20 states have call successors, (34) [2023-02-15 21:43:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2023-02-15 21:43:15,775 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 84 [2023-02-15 21:43:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:43:15,775 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2023-02-15 21:43:15,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2023-02-15 21:43:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2023-02-15 21:43:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-15 21:43:15,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:43:15,777 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:43:15,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 21:43:15,985 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,SelfDestructingSolverStorable14 [2023-02-15 21:43:15,985 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:43:15,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:43:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash -931767615, now seen corresponding path program 1 times [2023-02-15 21:43:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:43:15,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845516953] [2023-02-15 21:43:15,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:43:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:43:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 21:43:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 21:43:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 21:43:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 21:43:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 21:43:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 21:43:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:43:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:43:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-15 21:43:16,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:43:16,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845516953] [2023-02-15 21:43:16,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845516953] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:43:16,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354508051] [2023-02-15 21:43:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:43:16,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:43:16,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:43:16,229 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:43:16,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 21:43:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:43:16,381 WARN L261 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 196 conjunts are in the unsatisfiable core [2023-02-15 21:43:16,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:43:16,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:43:16,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-02-15 21:43:16,470 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:43:16,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 21:43:16,507 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1204 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1204))) is different from true [2023-02-15 21:43:16,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:43:16,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-02-15 21:43:16,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 21:43:16,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 21:43:16,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:43:16,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 21:43:16,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 21:43:16,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:43:16,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 21:43:16,817 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~left Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)))) (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) |c_upsweep_#in~a.offset|)) (select .cse0 .cse1))))))) is different from true [2023-02-15 21:43:16,887 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1213 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)) v_ArrVal_1213)))) is different from true [2023-02-15 21:43:16,955 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (v_upsweep_~left_107 Int) (v_ArrVal_1216 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (let ((.cse1 (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~left| 4))) (.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 (+ |c_upsweep_#in~a.offset| (* v_upsweep_~left_107 4)))))) (+ (* upsweep_~right 4) |c_upsweep_#in~a.offset|) v_ArrVal_1216))) (<= |c_upsweep_#in~right| upsweep_~right))) is different from true [2023-02-15 21:43:16,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2023-02-15 21:43:18,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2023-02-15 21:43:18,308 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse3 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4))) (.cse2 (select .cse0 .cse1))) (store (store .cse0 .cse1 (+ .cse2 (select .cse0 .cse3))) .cse3 .cse2))))) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2023-02-15 21:43:18,677 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_1226 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_1226) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))))) is different from true [2023-02-15 21:43:18,717 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse5 (select .cse10 .cse2)) (.cse4 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)))) (let ((.cse3 (store .cse10 .cse2 (+ .cse5 (select .cse10 .cse4))))) (let ((.cse6 (store .cse3 .cse4 .cse5)) (.cse0 (* 3 |c_downsweep_#in~left|))) (or (exists ((v_downsweep_~left_154 Int) (downsweep_~left Int) (v_ArrVal_1226 Int)) (and (<= v_downsweep_~left_154 |c_downsweep_#in~left|) (<= (+ (* 2 v_downsweep_~left_154) |c_downsweep_#in~right|) (+ .cse0 1)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse1 (let ((.cse7 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_154 4)))) (store (store .cse3 .cse4 (+ .cse5 (select .cse6 .cse7))) .cse7 .cse5)))) (store (store .cse1 .cse2 v_ArrVal_1226) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse1 .cse2))))))) (exists ((v_downsweep_~left_154 Int) (downsweep_~left Int) (v_ArrVal_1226 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse8 (let ((.cse9 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_154 4)))) (store (store .cse3 .cse4 (+ .cse5 (select .cse6 .cse9))) .cse9 .cse5)))) (store (store .cse8 .cse2 v_ArrVal_1226) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse8 .cse2))))) (<= (+ (* 2 v_downsweep_~left_154) |c_downsweep_#in~right|) .cse0)))))))) is different from true [2023-02-15 21:43:18,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 655 treesize of output 601 [2023-02-15 21:43:18,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 498 treesize of output 487 [2023-02-15 21:43:29,263 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:43:58,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:43:58,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1930 treesize of output 1938 [2023-02-15 21:43:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 17 not checked. [2023-02-15 21:43:58,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:44:40,035 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~n~0#1| 4) (- 4))) (.cse11 (div |c_ULTIMATE.start_main_~n~0#1| 2))) (let ((.cse10 (* 3 .cse11)) (.cse16 (* .cse11 4)) (.cse7 (select .cse15 .cse4)) (.cse1 (< |c_ULTIMATE.start_main_~n~0#1| 0)) (.cse0 (= 0 (mod |c_ULTIMATE.start_main_~n~0#1| 2)))) (and (or (and (not .cse0) .cse1) (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16 (- 4)))) (let ((.cse5 (store .cse15 .cse4 (+ .cse7 (select .cse15 .cse6))))) (let ((.cse8 (store .cse5 .cse6 .cse7))) (and (forall ((|v_ULTIMATE.start_check_~a#1.offset_17| Int)) (or (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_check_~a#1.offset_17|) (forall ((|v_ULTIMATE.start_check_~i~0#1_30| Int)) (or (not (<= |v_ULTIMATE.start_check_~i~0#1_30| 1)) (forall ((v_downsweep_~left_169 Int) (v_ArrVal_1241 Int) (v_downsweep_~left_170 Int)) (or (let ((.cse2 (let ((.cse3 (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_170 4)))) (store (store .cse5 .cse6 (+ .cse7 (select .cse8 .cse9))) .cse9 .cse7)))) (store (store .cse3 .cse4 v_ArrVal_1241) (+ (* v_downsweep_~left_169 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 .cse4))))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse2 (+ (* |v_ULTIMATE.start_check_~i~0#1_30| 4) |v_ULTIMATE.start_check_~a#1.offset_17|)))) (< .cse10 (+ |c_ULTIMATE.start_main_~n~0#1| (* 2 v_downsweep_~left_170) 1)) (< .cse11 (+ v_downsweep_~left_170 1)))))))) (forall ((|v_ULTIMATE.start_check_~a#1.offset_17| Int)) (or (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_check_~a#1.offset_17|) (forall ((|v_ULTIMATE.start_check_~i~0#1_30| Int)) (or (forall ((v_downsweep_~left_169 Int) (v_ArrVal_1241 Int) (v_downsweep_~left_170 Int)) (or (< .cse10 (+ |c_ULTIMATE.start_main_~n~0#1| (* 2 v_downsweep_~left_170) 2)) (let ((.cse12 (let ((.cse13 (let ((.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_170 4)))) (store (store .cse5 .cse6 (+ .cse7 (select .cse8 .cse14))) .cse14 .cse7)))) (store (store .cse13 .cse4 v_ArrVal_1241) (+ (* v_downsweep_~left_169 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse13 .cse4))))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse12 (+ (* |v_ULTIMATE.start_check_~i~0#1_30| 4) |v_ULTIMATE.start_check_~a#1.offset_17|)))))) (not (<= |v_ULTIMATE.start_check_~i~0#1_30| 1))))))))))) (or (forall ((v_downsweep_~left_169 Int) (v_ArrVal_1241 Int) (|v_ULTIMATE.start_check_~i~0#1_30| Int) (|v_ULTIMATE.start_check_~a#1.offset_17| Int) (v_downsweep_~left_170 Int)) (or (not (<= |v_ULTIMATE.start_check_~i~0#1_30| 1)) (< (+ .cse10 1) (+ |c_ULTIMATE.start_main_~n~0#1| (* 2 v_downsweep_~left_170))) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_check_~a#1.offset_17|) (let ((.cse17 (let ((.cse18 (let ((.cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_downsweep_~left_170 4)))) (store (let ((.cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16))) (let ((.cse19 (store .cse15 .cse4 (+ .cse7 (select .cse15 .cse20))))) (store .cse19 .cse20 (+ .cse7 (select (store .cse19 .cse20 .cse7) .cse21))))) .cse21 .cse7)))) (store (store .cse18 .cse4 v_ArrVal_1241) (+ (* v_downsweep_~left_169 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse18 .cse4))))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse17 (+ (* |v_ULTIMATE.start_check_~i~0#1_30| 4) |v_ULTIMATE.start_check_~a#1.offset_17|)))))) (not .cse1) .cse0)))) is different from false [2023-02-15 21:44:40,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354508051] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:44:40,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:44:40,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 35] total 42 [2023-02-15 21:44:40,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286585049] [2023-02-15 21:44:40,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:44:40,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 21:44:40,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:44:40,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 21:44:40,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1509, Unknown=24, NotChecked=680, Total=2352 [2023-02-15 21:44:40,051 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 42 states, 37 states have (on average 2.324324324324324) internal successors, (86), 34 states have internal predecessors, (86), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2023-02-15 21:44:46,730 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)))) (and (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_4| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_4|) 1)) (exists ((upsweep_~left Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) |c_upsweep_#in~a.offset|)) (select .cse0 .cse1)))))) (exists ((v_ArrVal_1213 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 .cse1 v_ArrVal_1213)))))) is different from true [2023-02-15 21:44:46,731 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ |c_upsweep_#in~a.offset| (* |c_upsweep_#in~right| 4)))) (and (exists ((upsweep_~left Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) |c_upsweep_#in~a.offset|)) (select .cse0 .cse1)))))) (exists ((v_ArrVal_1213 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 .cse1 v_ArrVal_1213)))))) is different from true [2023-02-15 21:44:50,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:44:54,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:44:56,286 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_4| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_4|) 1)) (let ((.cse10 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse5 (select .cse10 .cse2)) (.cse4 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)))) (let ((.cse3 (store .cse10 .cse2 (+ .cse5 (select .cse10 .cse4))))) (let ((.cse6 (store .cse3 .cse4 .cse5)) (.cse0 (* 3 |c_downsweep_#in~left|))) (or (exists ((v_downsweep_~left_154 Int) (downsweep_~left Int) (v_ArrVal_1226 Int)) (and (<= v_downsweep_~left_154 |c_downsweep_#in~left|) (<= (+ (* 2 v_downsweep_~left_154) |c_downsweep_#in~right|) (+ .cse0 1)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse1 (let ((.cse7 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_154 4)))) (store (store .cse3 .cse4 (+ .cse5 (select .cse6 .cse7))) .cse7 .cse5)))) (store (store .cse1 .cse2 v_ArrVal_1226) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse1 .cse2))))))) (exists ((v_downsweep_~left_154 Int) (downsweep_~left Int) (v_ArrVal_1226 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse8 (let ((.cse9 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_154 4)))) (store (store .cse3 .cse4 (+ .cse5 (select .cse6 .cse9))) .cse9 .cse5)))) (store (store .cse8 .cse2 v_ArrVal_1226) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse8 .cse2))))) (<= (+ (* 2 v_downsweep_~left_154) |c_downsweep_#in~right|) .cse0))))))))) is different from true [2023-02-15 21:44:58,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:45:00,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:45:25,576 WARN L233 SmtUtils]: Spent 16.20s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:45:29,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 21:45:34,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]