./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s3if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/array-fpi/s3if.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 e1607ef1a0546f5061a453264a19ed217d8c8fc9b28320eac9d61d4efa33b72e --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 21:37:44,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 21:37:44,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 21:37:44,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 21:37:44,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 21:37:44,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 21:37:44,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 21:37:44,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 21:37:44,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 21:37:44,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 21:37:44,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 21:37:44,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 21:37:44,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 21:37:44,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 21:37:44,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 21:37:44,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 21:37:44,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 21:37:44,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 21:37:44,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 21:37:44,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 21:37:44,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 21:37:44,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 21:37:44,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 21:37:44,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 21:37:44,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 21:37:44,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 21:37:44,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 21:37:44,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 21:37:44,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 21:37:44,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 21:37:44,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 21:37:44,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 21:37:44,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 21:37:44,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 21:37:44,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 21:37:44,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 21:37:44,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 21:37:44,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 21:37:44,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 21:37:44,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 21:37:44,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 21:37:44,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 21:37:44,706 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 21:37:44,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 21:37:44,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 21:37:44,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 21:37:44,708 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 21:37:44,708 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 21:37:44,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 21:37:44,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 21:37:44,709 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 21:37:44,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 21:37:44,710 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 21:37:44,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 21:37:44,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 21:37:44,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 21:37:44,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 21:37:44,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 21:37:44,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 21:37:44,711 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 21:37:44,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 21:37:44,711 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 21:37:44,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 21:37:44,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 21:37:44,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 21:37:44,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 21:37:44,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 21:37:44,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 21:37:44,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 21:37:44,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 21:37:44,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 21:37:44,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 21:37:44,713 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 21:37:44,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 21:37:44,714 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 21:37:44,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 21:37:44,714 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 21:37:44,714 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 -> e1607ef1a0546f5061a453264a19ed217d8c8fc9b28320eac9d61d4efa33b72e [2023-02-17 21:37:44,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 21:37:44,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 21:37:44,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 21:37:44,935 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 21:37:44,936 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 21:37:44,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s3if.c [2023-02-17 21:37:46,017 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 21:37:46,204 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 21:37:46,204 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s3if.c [2023-02-17 21:37:46,209 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ffc22ac/ad60c309739c470a93778499d5fc1157/FLAGb40543e30 [2023-02-17 21:37:46,224 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ffc22ac/ad60c309739c470a93778499d5fc1157 [2023-02-17 21:37:46,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 21:37:46,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 21:37:46,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 21:37:46,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 21:37:46,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 21:37:46,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264fc0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46, skipping insertion in model container [2023-02-17 21:37:46,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 21:37:46,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 21:37:46,382 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/array-fpi/s3if.c[587,600] [2023-02-17 21:37:46,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 21:37:46,402 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 21:37:46,413 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/array-fpi/s3if.c[587,600] [2023-02-17 21:37:46,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 21:37:46,430 INFO L208 MainTranslator]: Completed translation [2023-02-17 21:37:46,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46 WrapperNode [2023-02-17 21:37:46,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 21:37:46,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 21:37:46,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 21:37:46,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 21:37:46,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,460 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-02-17 21:37:46,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 21:37:46,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 21:37:46,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 21:37:46,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 21:37:46,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,479 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 21:37:46,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 21:37:46,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 21:37:46,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 21:37:46,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (1/1) ... [2023-02-17 21:37:46,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 21:37:46,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:37:46,514 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-17 21:37:46,515 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-17 21:37:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 21:37:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 21:37:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 21:37:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 21:37:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 21:37:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 21:37:46,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 21:37:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 21:37:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 21:37:46,591 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 21:37:46,593 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 21:37:46,747 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 21:37:46,752 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 21:37:46,755 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 21:37:46,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:37:46 BoogieIcfgContainer [2023-02-17 21:37:46,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 21:37:46,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 21:37:46,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 21:37:46,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 21:37:46,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 09:37:46" (1/3) ... [2023-02-17 21:37:46,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e1c547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:37:46, skipping insertion in model container [2023-02-17 21:37:46,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:37:46" (2/3) ... [2023-02-17 21:37:46,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e1c547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:37:46, skipping insertion in model container [2023-02-17 21:37:46,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:37:46" (3/3) ... [2023-02-17 21:37:46,770 INFO L112 eAbstractionObserver]: Analyzing ICFG s3if.c [2023-02-17 21:37:46,785 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 21:37:46,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 21:37:46,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 21:37:46,838 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;@67cd84c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 21:37:46,839 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 21:37:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 21:37:46,849 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:37:46,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:37:46,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:37:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:37:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2023-02-17 21:37:46,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:37:46,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003524073] [2023-02-17 21:37:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:37:46,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:37:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:37:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:37:47,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003524073] [2023-02-17 21:37:47,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003524073] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 21:37:47,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 21:37:47,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 21:37:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153953912] [2023-02-17 21:37:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 21:37:47,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 21:37:47,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:37:47,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 21:37:47,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 21:37:47,091 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:37:47,111 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2023-02-17 21:37:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 21:37:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-17 21:37:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:37:47,119 INFO L225 Difference]: With dead ends: 34 [2023-02-17 21:37:47,119 INFO L226 Difference]: Without dead ends: 15 [2023-02-17 21:37:47,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 21:37:47,125 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 21:37:47,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 21:37:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-17 21:37:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-17 21:37:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-17 21:37:47,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2023-02-17 21:37:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:37:47,152 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-17 21:37:47,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-17 21:37:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 21:37:47,153 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:37:47,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:37:47,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 21:37:47,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:37:47,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:37:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2023-02-17 21:37:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:37:47,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856304310] [2023-02-17 21:37:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:37:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:37:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:37:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:47,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:37:47,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856304310] [2023-02-17 21:37:47,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856304310] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 21:37:47,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 21:37:47,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 21:37:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150960902] [2023-02-17 21:37:47,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 21:37:47,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 21:37:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:37:47,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 21:37:47,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 21:37:47,356 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:37:47,440 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-02-17 21:37:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 21:37:47,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-17 21:37:47,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:37:47,441 INFO L225 Difference]: With dead ends: 28 [2023-02-17 21:37:47,441 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 21:37:47,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 21:37:47,443 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 21:37:47,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 21:37:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 21:37:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-02-17 21:37:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-02-17 21:37:47,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2023-02-17 21:37:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:37:47,455 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-02-17 21:37:47,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-02-17 21:37:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 21:37:47,456 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:37:47,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:37:47,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 21:37:47,457 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:37:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:37:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2023-02-17 21:37:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:37:47,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009567854] [2023-02-17 21:37:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:37:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:37:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:37:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:37:47,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009567854] [2023-02-17 21:37:47,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009567854] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 21:37:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119030428] [2023-02-17 21:37:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:37:47,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:37:47,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:37:47,954 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-17 21:37:47,980 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-17 21:37:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:37:48,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 21:37:48,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:37:48,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 21:37:48,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 21:37:48,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 21:37:48,192 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 44 treesize of output 27 [2023-02-17 21:37:48,283 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 49 treesize of output 29 [2023-02-17 21:37:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:48,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:37:48,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:37:48,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2023-02-17 21:37:48,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 21:37:48,548 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 66 treesize of output 54 [2023-02-17 21:37:48,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-17 21:37:48,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-17 21:37:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:48,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119030428] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:37:48,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 21:37:48,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2023-02-17 21:37:48,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365527344] [2023-02-17 21:37:48,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 21:37:48,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 21:37:48,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:37:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 21:37:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=269, Unknown=1, NotChecked=0, Total=342 [2023-02-17 21:37:48,565 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:37:48,844 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-17 21:37:48,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 21:37:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-17 21:37:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:37:48,847 INFO L225 Difference]: With dead ends: 39 [2023-02-17 21:37:48,847 INFO L226 Difference]: Without dead ends: 35 [2023-02-17 21:37:48,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=530, Unknown=1, NotChecked=0, Total=702 [2023-02-17 21:37:48,848 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 21:37:48,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 21:37:48,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-17 21:37:48,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2023-02-17 21:37:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-17 21:37:48,858 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2023-02-17 21:37:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:37:48,858 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-17 21:37:48,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-17 21:37:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 21:37:48,859 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:37:48,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:37:48,871 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-17 21:37:49,066 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-17 21:37:49,067 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:37:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:37:49,068 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2023-02-17 21:37:49,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:37:49,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485414436] [2023-02-17 21:37:49,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:37:49,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:37:49,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:37:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845163998] [2023-02-17 21:37:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:37:49,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:37:49,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:37:49,083 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-17 21:37:49,086 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-17 21:37:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:37:49,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 21:37:49,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:37:49,141 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 15 treesize of output 11 [2023-02-17 21:37:49,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-02-17 21:37:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:49,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:37:49,167 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 18 treesize of output 16 [2023-02-17 21:37:49,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2023-02-17 21:37:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:49,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:37:49,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485414436] [2023-02-17 21:37:49,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:37:49,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845163998] [2023-02-17 21:37:49,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845163998] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:37:49,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:37:49,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-02-17 21:37:49,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430335136] [2023-02-17 21:37:49,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:37:49,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 21:37:49,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:37:49,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 21:37:49,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-17 21:37:49,178 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:37:49,218 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-02-17 21:37:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 21:37:49,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-17 21:37:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:37:49,220 INFO L225 Difference]: With dead ends: 38 [2023-02-17 21:37:49,220 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 21:37:49,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-02-17 21:37:49,221 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 21:37:49,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 21:37:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 21:37:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-17 21:37:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-02-17 21:37:49,227 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2023-02-17 21:37:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:37:49,227 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-02-17 21:37:49,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-02-17 21:37:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 21:37:49,228 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:37:49,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:37:49,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 21:37:49,436 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-17 21:37:49,437 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:37:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:37:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2023-02-17 21:37:49,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:37:49,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687731713] [2023-02-17 21:37:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:37:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:37:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:37:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:37:49,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687731713] [2023-02-17 21:37:49,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687731713] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 21:37:49,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767020505] [2023-02-17 21:37:49,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 21:37:49,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:37:49,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:37:49,505 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-17 21:37:49,528 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-17 21:37:49,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 21:37:49,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:37:49,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 21:37:49,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:37:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:49,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:37:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:49,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767020505] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:37:49,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 21:37:49,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-17 21:37:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649463598] [2023-02-17 21:37:49,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 21:37:49,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 21:37:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:37:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 21:37:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-17 21:37:49,627 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:37:49,716 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-17 21:37:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 21:37:49,717 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 21:37:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:37:49,719 INFO L225 Difference]: With dead ends: 33 [2023-02-17 21:37:49,719 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 21:37:49,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-17 21:37:49,723 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 21:37:49,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 21:37:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 21:37:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2023-02-17 21:37:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-02-17 21:37:49,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2023-02-17 21:37:49,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:37:49,734 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-02-17 21:37:49,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-02-17 21:37:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 21:37:49,734 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:37:49,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:37:49,742 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-17 21:37:49,942 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-17 21:37:49,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:37:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:37:49,943 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2023-02-17 21:37:49,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:37:49,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022388420] [2023-02-17 21:37:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:37:49,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:37:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:37:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:50,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:37:50,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022388420] [2023-02-17 21:37:50,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022388420] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 21:37:50,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873659897] [2023-02-17 21:37:50,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 21:37:50,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:37:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:37:50,005 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-17 21:37:50,028 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-17 21:37:50,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 21:37:50,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:37:50,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 21:37:50,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:37:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:50,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:37:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:50,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873659897] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:37:50,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 21:37:50,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-17 21:37:50,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496665699] [2023-02-17 21:37:50,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 21:37:50,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 21:37:50,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:37:50,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 21:37:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-17 21:37:50,121 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:37:50,191 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-02-17 21:37:50,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 21:37:50,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-17 21:37:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:37:50,193 INFO L225 Difference]: With dead ends: 37 [2023-02-17 21:37:50,193 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 21:37:50,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-17 21:37:50,194 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 21:37:50,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 30 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 21:37:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 21:37:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-02-17 21:37:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-17 21:37:50,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2023-02-17 21:37:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:37:50,199 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-17 21:37:50,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:37:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-17 21:37:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 21:37:50,200 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:37:50,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:37:50,208 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-17 21:37:50,405 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-17 21:37:50,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:37:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:37:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2023-02-17 21:37:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:37:50,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022502990] [2023-02-17 21:37:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:37:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:37:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:37:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:50,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:37:50,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022502990] [2023-02-17 21:37:50,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022502990] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 21:37:50,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647230638] [2023-02-17 21:37:50,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 21:37:50,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:37:50,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:37:50,825 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-17 21:37:50,826 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-17 21:37:50,874 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 21:37:50,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:37:50,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-17 21:37:50,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:37:50,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 21:37:50,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 21:37:50,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 21:37:50,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 21:37:50,975 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 44 treesize of output 27 [2023-02-17 21:37:51,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:37:51,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 61 [2023-02-17 21:37:51,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:37:51,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 264 [2023-02-17 21:37:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:37:59,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:38:00,213 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (= .cse0 3)) (not (>= |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1))) (not (>= |v_ULTIMATE.start_main_~i~0#1_43| 0)) (< (+ (* 3 |c_ULTIMATE.start_main_~i~0#1|) 3) (+ .cse0 .cse1 .cse2 1)) (< .cse3 (+ |v_ULTIMATE.start_main_~i~0#1_42| 1)) (not (= 3 .cse2)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (= .cse6 3)) (not (>= |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1))) (not (>= |v_ULTIMATE.start_main_~i~0#1_43| 0)) (< .cse3 (+ |v_ULTIMATE.start_main_~i~0#1_42| 1)) (not (= 3 .cse7)) (< (+ (- 1) .cse6 .cse8 .cse7) (+ 3 (* |v_ULTIMATE.start_main_~i~0#1_42| 3))))))))))) is different from false [2023-02-17 21:38:00,230 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (= .cse0 3)) (not (>= |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1))) (not (>= |v_ULTIMATE.start_main_~i~0#1_43| 0)) (< .cse1 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= 3 .cse2)) (< (+ (- 1) .cse0 .cse3 .cse2) (+ 3 (* |v_ULTIMATE.start_main_~i~0#1_42| 3))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (= .cse6 3)) (not (>= |v_ULTIMATE.start_main_~i~0#1_42| (+ |v_ULTIMATE.start_main_~i~0#1_43| 1))) (not (>= |v_ULTIMATE.start_main_~i~0#1_43| 0)) (< .cse1 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= 3 .cse7)) (< (+ (* 3 |c_ULTIMATE.start_main_~i~0#1|) 3) (+ .cse6 (- 2) .cse8 .cse7)))))))))) is different from false [2023-02-17 21:38:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-17 21:38:00,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647230638] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:38:00,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 21:38:00,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2023-02-17 21:38:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748189513] [2023-02-17 21:38:00,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 21:38:00,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-17 21:38:00,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:38:00,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-17 21:38:00,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=935, Unknown=2, NotChecked=126, Total=1190 [2023-02-17 21:38:00,260 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:02,815 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 [1] [2023-02-17 21:38:05,244 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, 1] [2023-02-17 21:38:07,793 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 [1] [2023-02-17 21:38:09,813 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 [1] [2023-02-17 21:38:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:38:12,652 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-02-17 21:38:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 21:38:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-17 21:38:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:38:12,657 INFO L225 Difference]: With dead ends: 52 [2023-02-17 21:38:12,657 INFO L226 Difference]: Without dead ends: 41 [2023-02-17 21:38:12,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=348, Invalid=2309, Unknown=3, NotChecked=202, Total=2862 [2023-02-17 21:38:12,659 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-02-17 21:38:12,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 79 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 488 Invalid, 4 Unknown, 71 Unchecked, 9.3s Time] [2023-02-17 21:38:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-17 21:38:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2023-02-17 21:38:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-02-17 21:38:12,668 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 21 [2023-02-17 21:38:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:38:12,668 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-02-17 21:38:12,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-02-17 21:38:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 21:38:12,669 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:38:12,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:38:12,675 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-17 21:38:12,875 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-17 21:38:12,875 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:38:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:38:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2023-02-17 21:38:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:38:12,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730549389] [2023-02-17 21:38:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:38:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:38:12,890 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:38:12,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255095630] [2023-02-17 21:38:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:38:12,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:38:12,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:38:12,904 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-17 21:38:12,909 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-17 21:38:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:38:12,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 21:38:12,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:38:12,982 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 17 treesize of output 13 [2023-02-17 21:38:12,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:38:13,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 21:38:13,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2023-02-17 21:38:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:38:13,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:38:13,043 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:38:13,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:38:13,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-17 21:38:13,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:38:13,067 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 46 treesize of output 46 [2023-02-17 21:38:13,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-02-17 21:38:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-17 21:38:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:38:13,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730549389] [2023-02-17 21:38:13,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:38:13,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255095630] [2023-02-17 21:38:13,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255095630] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:38:13,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:38:13,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-17 21:38:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908694372] [2023-02-17 21:38:13,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:38:13,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 21:38:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:38:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 21:38:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=146, Unknown=2, NotChecked=24, Total=210 [2023-02-17 21:38:13,096 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:38:13,189 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-02-17 21:38:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 21:38:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-17 21:38:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:38:13,190 INFO L225 Difference]: With dead ends: 52 [2023-02-17 21:38:13,190 INFO L226 Difference]: Without dead ends: 40 [2023-02-17 21:38:13,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=240, Unknown=2, NotChecked=32, Total=342 [2023-02-17 21:38:13,192 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 21:38:13,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2023-02-17 21:38:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-17 21:38:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-02-17 21:38:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-02-17 21:38:13,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 21 [2023-02-17 21:38:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:38:13,199 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-02-17 21:38:13,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-02-17 21:38:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 21:38:13,200 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:38:13,200 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:38:13,211 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-17 21:38:13,406 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-17 21:38:13,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:38:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:38:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2023-02-17 21:38:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:38:13,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750553177] [2023-02-17 21:38:13,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:38:13,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:38:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:38:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:38:13,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:38:13,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750553177] [2023-02-17 21:38:13,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750553177] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 21:38:13,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117028492] [2023-02-17 21:38:13,475 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 21:38:13,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:38:13,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:38:13,476 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-17 21:38:13,480 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-17 21:38:13,542 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-17 21:38:13,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:38:13,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 21:38:13,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:38:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:38:13,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:38:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:38:13,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117028492] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:38:13,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 21:38:13,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-17 21:38:13,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092596729] [2023-02-17 21:38:13,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 21:38:13,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 21:38:13,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:38:13,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 21:38:13,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-17 21:38:13,615 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:38:13,742 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-02-17 21:38:13,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 21:38:13,742 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-17 21:38:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:38:13,743 INFO L225 Difference]: With dead ends: 47 [2023-02-17 21:38:13,743 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 21:38:13,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-17 21:38:13,744 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 21:38:13,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 33 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 21:38:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 21:38:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-02-17 21:38:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-02-17 21:38:13,752 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2023-02-17 21:38:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:38:13,754 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-02-17 21:38:13,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-02-17 21:38:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 21:38:13,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:38:13,756 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:38:13,765 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-17 21:38:13,957 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-17 21:38:13,957 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:38:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:38:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash -981578845, now seen corresponding path program 2 times [2023-02-17 21:38:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:38:13,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043531780] [2023-02-17 21:38:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:38:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:38:13,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:38:13,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006587673] [2023-02-17 21:38:13,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 21:38:13,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:38:13,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:38:13,970 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-17 21:38:13,972 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-17 21:38:14,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 21:38:14,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:38:14,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 21:38:14,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:38:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:38:14,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:38:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:38:14,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:38:14,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043531780] [2023-02-17 21:38:14,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:38:14,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006587673] [2023-02-17 21:38:14,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006587673] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:38:14,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:38:14,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-17 21:38:14,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030274033] [2023-02-17 21:38:14,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:38:14,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 21:38:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:38:14,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 21:38:14,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-17 21:38:14,105 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:38:14,186 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2023-02-17 21:38:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 21:38:14,186 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-17 21:38:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:38:14,186 INFO L225 Difference]: With dead ends: 51 [2023-02-17 21:38:14,186 INFO L226 Difference]: Without dead ends: 30 [2023-02-17 21:38:14,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-02-17 21:38:14,187 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 21:38:14,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 21:38:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-17 21:38:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-02-17 21:38:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-02-17 21:38:14,192 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2023-02-17 21:38:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:38:14,192 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-02-17 21:38:14,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-02-17 21:38:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 21:38:14,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:38:14,193 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:38:14,200 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-17 21:38:14,400 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-17 21:38:14,401 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:38:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:38:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2023-02-17 21:38:14,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:38:14,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137583333] [2023-02-17 21:38:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:38:14,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:38:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:38:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:38:14,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:38:14,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137583333] [2023-02-17 21:38:14,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137583333] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 21:38:14,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380811348] [2023-02-17 21:38:14,875 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 21:38:14,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:38:14,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:38:14,877 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-17 21:38:14,885 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-17 21:38:14,954 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-17 21:38:14,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:38:14,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-17 21:38:14,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:38:14,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 21:38:14,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:38:14,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 21:38:14,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:38:14,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 21:38:14,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:38:14,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 21:38:15,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:38:15,038 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 44 treesize of output 27 [2023-02-17 21:38:15,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:38:15,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:38:15,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2023-02-17 21:38:15,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:38:15,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:38:15,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 115 [2023-02-17 21:38:15,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:38:15,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:38:15,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 37 [2023-02-17 21:38:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 21:38:15,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:38:38,746 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse3 (+ 3 (* .cse19 3))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (+ .cse0 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse2 (+ .cse4 .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse0 3)) (< (+ (- 1) .cse1 .cse2) .cse3) (not (= .cse1 3)) (not (= .cse4 3)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse11 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (+ .cse11 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse13 (+ .cse14 .cse17))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse11 3)) (not (= .cse12 3)) (< .cse3 (+ .cse12 .cse13 1)) (not (= .cse14 3)))))))))))))) is different from false [2023-02-17 21:38:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2023-02-17 21:38:38,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380811348] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:38:38,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 21:38:38,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 43 [2023-02-17 21:38:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916685150] [2023-02-17 21:38:38,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 21:38:38,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-17 21:38:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:38:38,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-17 21:38:38,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1558, Unknown=9, NotChecked=80, Total=1806 [2023-02-17 21:38:38,913 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:38:42,061 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse3 (+ 3 (* .cse19 3))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (+ .cse0 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse2 (+ .cse4 .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse0 3)) (< (+ (- 1) .cse1 .cse2) .cse3) (not (= .cse1 3)) (not (= .cse4 3)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse11 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (+ .cse11 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse13 (+ .cse14 .cse17))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse11 3)) (not (= .cse12 3)) (< .cse3 (+ .cse12 .cse13 1)) (not (= .cse14 3)))))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) is different from false [2023-02-17 21:38:44,787 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse3 (+ 3 (* .cse19 3))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (+ .cse0 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse2 (+ .cse4 .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse0 3)) (< (+ (- 1) .cse1 .cse2) .cse3) (not (= .cse1 3)) (not (= .cse4 3)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse11 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (+ .cse11 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse13 (+ .cse14 .cse17))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse11 3)) (not (= .cse12 3)) (< .cse3 (+ .cse12 .cse13 1)) (not (= .cse14 3)))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) is different from false [2023-02-17 21:38:47,549 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse3 (+ 3 (* .cse19 3))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (+ .cse0 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse2 (+ .cse4 .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse0 3)) (< (+ (- 1) .cse1 .cse2) .cse3) (not (= .cse1 3)) (not (= .cse4 3)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse11 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (+ .cse11 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse13 (+ .cse14 .cse17))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse11 3)) (not (= .cse12 3)) (< .cse3 (+ .cse12 .cse13 1)) (not (= .cse14 3)))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 0 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-02-17 21:38:50,302 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse3 (+ 3 (* .cse19 3))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (+ .cse0 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse2 (+ .cse4 .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse0 3)) (< (+ (- 1) .cse1 .cse2) .cse3) (not (= .cse1 3)) (not (= .cse4 3)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse11 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (+ .cse11 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse13 (+ .cse14 .cse17))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse11 3)) (not (= .cse12 3)) (< .cse3 (+ .cse12 .cse13 1)) (not (= .cse14 3)))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= 0 (+ (- 2) |c_ULTIMATE.start_main_~i~0#1|)) (<= |c_ULTIMATE.start_main_~i~0#1| 2))))) is different from false [2023-02-17 21:38:53,036 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse3 (+ 3 (* .cse19 3))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (+ .cse0 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse2 (+ .cse4 .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse0 3)) (< (+ (- 1) .cse1 .cse2) .cse3) (not (= .cse1 3)) (not (= .cse4 3)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse11 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (+ .cse11 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse13 (+ .cse14 .cse17))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse11 3)) (not (= .cse12 3)) (< .cse3 (+ .cse12 .cse13 1)) (not (= .cse14 3)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (<= 0 (+ c_~N~0 (- 3))))))) is different from false [2023-02-17 21:38:55,776 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse3 (+ 3 (* .cse19 3))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (+ .cse0 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse2 (+ .cse4 .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse0 3)) (< (+ (- 1) .cse1 .cse2) .cse3) (not (= .cse1 3)) (not (= .cse4 3)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse11 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (+ .cse11 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse13 (+ .cse14 .cse17))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse11 3)) (not (= .cse12 3)) (< .cse3 (+ .cse12 .cse13 1)) (not (= .cse14 3)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (<= 0 (+ c_~N~0 (- 3))))))) is different from false [2023-02-17 21:38:58,710 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse3 (+ 3 (* .cse19 3))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (+ .cse0 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse2 (+ .cse4 .cse8))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse0 3)) (< (+ (- 1) .cse1 .cse2) .cse3) (not (= .cse1 3)) (not (= .cse4 3)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse11 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10))) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (+ .cse11 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse13 (+ .cse14 .cse17))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (not (= .cse11 3)) (not (= .cse12 3)) (< .cse3 (+ .cse12 .cse13 1)) (not (= .cse14 3)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) is different from false [2023-02-17 21:39:10,018 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, 1] [2023-02-17 21:39:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:39:20,744 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2023-02-17 21:39:20,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-17 21:39:20,744 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-17 21:39:20,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:39:20,745 INFO L225 Difference]: With dead ends: 61 [2023-02-17 21:39:20,745 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 21:39:20,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=517, Invalid=4326, Unknown=19, NotChecked=1144, Total=6006 [2023-02-17 21:39:20,747 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-02-17 21:39:20,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 101 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 453 Invalid, 1 Unknown, 40 Unchecked, 6.5s Time] [2023-02-17 21:39:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 21:39:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2023-02-17 21:39:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2023-02-17 21:39:20,756 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2023-02-17 21:39:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:39:20,757 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2023-02-17 21:39:20,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2023-02-17 21:39:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 21:39:20,758 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:39:20,758 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:39:20,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 21:39:20,965 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-17 21:39:20,965 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:39:20,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:39:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 3 times [2023-02-17 21:39:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:39:20,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771918832] [2023-02-17 21:39:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:39:20,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:39:20,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:39:20,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035619644] [2023-02-17 21:39:20,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 21:39:20,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:39:20,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:39:20,988 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-17 21:39:20,995 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-17 21:39:21,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 21:39:21,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:39:21,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 21:39:21,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:39:21,104 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 15 treesize of output 11 [2023-02-17 21:39:21,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:39:21,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 21:39:21,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:39:21,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 21:39:21,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:39:21,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2023-02-17 21:39:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 21:39:21,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:39:28,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:39:28,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-17 21:39:28,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:39:28,541 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 42 [2023-02-17 21:39:28,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-02-17 21:39:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 21:39:30,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:39:30,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771918832] [2023-02-17 21:39:30,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:39:30,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035619644] [2023-02-17 21:39:30,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035619644] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:39:30,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:39:30,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-17 21:39:30,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723182061] [2023-02-17 21:39:30,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:39:30,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 21:39:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:39:30,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 21:39:30,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=173, Unknown=7, NotChecked=0, Total=240 [2023-02-17 21:39:30,664 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:39:31,373 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2023-02-17 21:39:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 21:39:31,374 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-17 21:39:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:39:31,374 INFO L225 Difference]: With dead ends: 48 [2023-02-17 21:39:31,374 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 21:39:31,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=118, Invalid=255, Unknown=7, NotChecked=0, Total=380 [2023-02-17 21:39:31,375 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 21:39:31,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 19 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 21:39:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 21:39:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-17 21:39:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-02-17 21:39:31,388 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 26 [2023-02-17 21:39:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:39:31,390 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-02-17 21:39:31,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-02-17 21:39:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 21:39:31,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:39:31,393 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:39:31,400 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-17 21:39:31,597 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-17 21:39:31,597 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:39:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:39:31,598 INFO L85 PathProgramCache]: Analyzing trace with hash -798779835, now seen corresponding path program 4 times [2023-02-17 21:39:31,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:39:31,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488664097] [2023-02-17 21:39:31,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:39:31,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:39:31,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:39:31,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354133382] [2023-02-17 21:39:31,607 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 21:39:31,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:39:31,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:39:31,609 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-17 21:39:31,613 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-17 21:39:31,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 21:39:31,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:39:31,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 21:39:31,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:39:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:39:32,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:39:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:39:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:39:32,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488664097] [2023-02-17 21:39:32,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:39:32,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354133382] [2023-02-17 21:39:32,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354133382] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:39:32,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:39:32,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2023-02-17 21:39:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075907464] [2023-02-17 21:39:32,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:39:32,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 21:39:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:39:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 21:39:32,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-17 21:39:32,533 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:39:33,491 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2023-02-17 21:39:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 21:39:33,491 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-17 21:39:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:39:33,492 INFO L225 Difference]: With dead ends: 68 [2023-02-17 21:39:33,492 INFO L226 Difference]: Without dead ends: 45 [2023-02-17 21:39:33,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2023-02-17 21:39:33,493 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 21:39:33,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 21:39:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-17 21:39:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2023-02-17 21:39:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-17 21:39:33,500 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2023-02-17 21:39:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:39:33,500 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-17 21:39:33,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-17 21:39:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 21:39:33,501 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:39:33,501 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:39:33,509 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-17 21:39:33,707 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-17 21:39:33,707 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:39:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:39:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1338916473, now seen corresponding path program 5 times [2023-02-17 21:39:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:39:33,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899628032] [2023-02-17 21:39:33,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:39:33,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:39:33,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:39:33,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217507739] [2023-02-17 21:39:33,722 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 21:39:33,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:39:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:39:33,725 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-17 21:39:33,747 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-17 21:39:33,841 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-02-17 21:39:33,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:39:33,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 21:39:33,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:39:33,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 21:39:33,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 21:39:34,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:39:34,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-02-17 21:39:34,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:39:34,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:39:34,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:39:34,531 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 27 treesize of output 10 [2023-02-17 21:39:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 21:39:34,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:39:35,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:39:35,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ 0 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:39:37,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:39:37,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 80 [2023-02-17 21:39:37,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:39:37,925 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 95 treesize of output 99 [2023-02-17 21:39:37,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-17 21:39:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2023-02-17 21:39:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:39:38,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899628032] [2023-02-17 21:39:38,396 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:39:38,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217507739] [2023-02-17 21:39:38,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217507739] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:39:38,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:39:38,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-02-17 21:39:38,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482769706] [2023-02-17 21:39:38,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:39:38,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 21:39:38,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:39:38,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 21:39:38,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=8, NotChecked=78, Total=506 [2023-02-17 21:39:38,398 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:39:40,924 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2023-02-17 21:39:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 21:39:40,925 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-17 21:39:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:39:40,925 INFO L225 Difference]: With dead ends: 45 [2023-02-17 21:39:40,925 INFO L226 Difference]: Without dead ends: 36 [2023-02-17 21:39:40,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=8, NotChecked=94, Total=702 [2023-02-17 21:39:40,926 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-17 21:39:40,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 70 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 309 Invalid, 0 Unknown, 54 Unchecked, 2.1s Time] [2023-02-17 21:39:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-17 21:39:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-02-17 21:39:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-02-17 21:39:40,934 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 31 [2023-02-17 21:39:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:39:40,934 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-02-17 21:39:40,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-02-17 21:39:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 21:39:40,935 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:39:40,935 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:39:40,941 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-17 21:39:41,140 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-17 21:39:41,141 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:39:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:39:41,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1661543779, now seen corresponding path program 6 times [2023-02-17 21:39:41,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:39:41,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916305480] [2023-02-17 21:39:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:39:41,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:39:41,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:39:41,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233206585] [2023-02-17 21:39:41,151 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 21:39:41,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:39:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:39:41,152 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-17 21:39:41,157 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-17 21:39:41,246 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-02-17 21:39:41,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:39:41,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 21:39:41,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:39:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:39:41,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:39:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:39:42,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:39:42,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916305480] [2023-02-17 21:39:42,427 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:39:42,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233206585] [2023-02-17 21:39:42,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233206585] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:39:42,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:39:42,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-02-17 21:39:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619007364] [2023-02-17 21:39:42,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:39:42,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 21:39:42,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:39:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 21:39:42,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-02-17 21:39:42,429 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:39:43,646 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2023-02-17 21:39:43,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 21:39:43,647 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-17 21:39:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:39:43,647 INFO L225 Difference]: With dead ends: 78 [2023-02-17 21:39:43,647 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 21:39:43,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2023-02-17 21:39:43,648 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 21:39:43,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 31 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 21:39:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 21:39:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2023-02-17 21:39:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-02-17 21:39:43,657 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2023-02-17 21:39:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:39:43,657 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-02-17 21:39:43,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-02-17 21:39:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 21:39:43,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:39:43,658 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:39:43,666 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-17 21:39:43,864 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-17 21:39:43,864 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:39:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:39:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 83735393, now seen corresponding path program 7 times [2023-02-17 21:39:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:39:43,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703870733] [2023-02-17 21:39:43,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:39:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:39:43,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:39:43,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412674957] [2023-02-17 21:39:43,875 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 21:39:43,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:39:43,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:39:43,877 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-17 21:39:43,880 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-17 21:39:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:39:43,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-17 21:39:43,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:39:43,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 21:39:44,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 21:39:44,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2023-02-17 21:39:44,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 21:39:44,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 21:39:44,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 21:39:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 21:39:44,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:39:46,288 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1))) (or (forall ((v_ArrVal_558 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* .cse0 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ .cse0 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3))))) is different from false [2023-02-17 21:39:46,311 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1))) (or (forall ((v_ArrVal_559 (Array Int Int))) (not (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ .cse0 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (forall ((v_ArrVal_558 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* .cse0 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2023-02-17 21:39:46,335 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (+ (+ 0 1) 1) 1))) (or (forall ((v_ArrVal_559 (Array Int Int))) (not (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ .cse0 1) 4)))))) (forall ((v_ArrVal_558 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* .cse0 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2023-02-17 21:39:46,358 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_555))) (.cse1 (+ (+ (+ 0 1) 1) 1))) (or (not (= 3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ .cse1 1) 4))))) (= 3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* .cse1 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2023-02-17 21:39:46,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:39:46,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 70 [2023-02-17 21:39:46,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:39:46,719 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 102 treesize of output 110 [2023-02-17 21:39:46,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2023-02-17 21:39:46,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2023-02-17 21:39:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2023-02-17 21:39:47,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:39:47,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703870733] [2023-02-17 21:39:47,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:39:47,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412674957] [2023-02-17 21:39:47,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412674957] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:39:47,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:39:47,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2023-02-17 21:39:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492577371] [2023-02-17 21:39:47,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:39:47,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 21:39:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:39:47,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 21:39:47,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=517, Unknown=13, NotChecked=196, Total=812 [2023-02-17 21:39:47,551 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:39:53,426 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2023-02-17 21:39:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 21:39:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-17 21:39:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:39:53,427 INFO L225 Difference]: With dead ends: 66 [2023-02-17 21:39:53,427 INFO L226 Difference]: Without dead ends: 57 [2023-02-17 21:39:53,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=152, Invalid=973, Unknown=13, NotChecked=268, Total=1406 [2023-02-17 21:39:53,428 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-17 21:39:53,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 107 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 587 Invalid, 0 Unknown, 152 Unchecked, 3.9s Time] [2023-02-17 21:39:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-17 21:39:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2023-02-17 21:39:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-02-17 21:39:53,435 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2023-02-17 21:39:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:39:53,435 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-02-17 21:39:53,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-02-17 21:39:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 21:39:53,436 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:39:53,436 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:39:53,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-17 21:39:53,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:39:53,641 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:39:53,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:39:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1146006857, now seen corresponding path program 8 times [2023-02-17 21:39:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:39:53,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472252685] [2023-02-17 21:39:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:39:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:39:53,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:39:53,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140891924] [2023-02-17 21:39:53,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 21:39:53,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:39:53,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:39:53,658 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:39:53,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-17 21:39:53,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 21:39:53,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:39:53,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 21:39:53,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:39:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:39:54,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:39:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:39:55,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:39:55,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472252685] [2023-02-17 21:39:55,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:39:55,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140891924] [2023-02-17 21:39:55,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140891924] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:39:55,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:39:55,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2023-02-17 21:39:55,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074701014] [2023-02-17 21:39:55,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:39:55,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 21:39:55,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:39:55,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 21:39:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-02-17 21:39:55,367 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:39:56,574 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2023-02-17 21:39:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 21:39:56,575 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-17 21:39:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:39:56,576 INFO L225 Difference]: With dead ends: 86 [2023-02-17 21:39:56,576 INFO L226 Difference]: Without dead ends: 55 [2023-02-17 21:39:56,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2023-02-17 21:39:56,577 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 21:39:56,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 31 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 21:39:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-17 21:39:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2023-02-17 21:39:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2023-02-17 21:39:56,587 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2023-02-17 21:39:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:39:56,587 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2023-02-17 21:39:56,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:39:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2023-02-17 21:39:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 21:39:56,588 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:39:56,588 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:39:56,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-17 21:39:56,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-17 21:39:56,793 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:39:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:39:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 127479307, now seen corresponding path program 9 times [2023-02-17 21:39:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:39:56,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658993728] [2023-02-17 21:39:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:39:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:39:56,810 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:39:56,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474724890] [2023-02-17 21:39:56,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 21:39:56,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:39:56,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:39:56,811 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:39:56,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-17 21:39:56,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-02-17 21:39:56,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:39:56,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 21:39:56,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:39:56,973 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 15 treesize of output 11 [2023-02-17 21:39:57,043 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 29 treesize of output 28 [2023-02-17 21:39:57,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:39:57,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 21:39:57,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:39:57,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 21:39:57,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:39:57,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 21:39:57,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:39:57,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 21:39:57,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:39:57,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2023-02-17 21:39:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 38 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-17 21:39:57,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:39:58,493 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse0 (+ (- 1) c_~N~0))) (or (<= .cse0 |ULTIMATE.start_main_~i~0#1|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_687) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) .cse0)))) is different from false [2023-02-17 21:40:13,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:40:13,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-02-17 21:40:13,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:40:13,661 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 42 [2023-02-17 21:40:13,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-02-17 21:40:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 18 refuted. 5 times theorem prover too weak. 31 trivial. 29 not checked. [2023-02-17 21:40:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:40:15,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658993728] [2023-02-17 21:40:15,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:40:15,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474724890] [2023-02-17 21:40:15,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474724890] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:40:15,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:40:15,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2023-02-17 21:40:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593682225] [2023-02-17 21:40:15,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:40:15,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 21:40:15,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:40:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 21:40:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=290, Unknown=21, NotChecked=36, Total=420 [2023-02-17 21:40:15,812 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:40:21,930 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2023-02-17 21:40:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 21:40:21,930 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-17 21:40:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:40:21,931 INFO L225 Difference]: With dead ends: 51 [2023-02-17 21:40:21,931 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 21:40:21,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=282, Invalid=821, Unknown=23, NotChecked=64, Total=1190 [2023-02-17 21:40:21,932 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 21:40:21,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 32 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 140 Invalid, 0 Unknown, 21 Unchecked, 1.0s Time] [2023-02-17 21:40:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 21:40:21,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-02-17 21:40:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-02-17 21:40:21,944 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 41 [2023-02-17 21:40:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:40:21,944 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-02-17 21:40:21,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-02-17 21:40:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 21:40:21,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:40:21,945 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:40:21,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-17 21:40:22,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-17 21:40:22,145 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:40:22,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:40:22,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1771002085, now seen corresponding path program 10 times [2023-02-17 21:40:22,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:40:22,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852475401] [2023-02-17 21:40:22,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:40:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:40:22,157 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:40:22,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667142391] [2023-02-17 21:40:22,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 21:40:22,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:40:22,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:40:22,159 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:40:22,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-17 21:40:22,302 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 21:40:22,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:40:22,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 21:40:22,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:40:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:40:23,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:40:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:40:24,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:40:24,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852475401] [2023-02-17 21:40:24,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:40:24,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667142391] [2023-02-17 21:40:24,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667142391] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:40:24,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:40:24,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2023-02-17 21:40:24,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415633930] [2023-02-17 21:40:24,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:40:24,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 21:40:24,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:40:24,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 21:40:24,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2023-02-17 21:40:24,340 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:40:26,246 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2023-02-17 21:40:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 21:40:26,247 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-17 21:40:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:40:26,247 INFO L225 Difference]: With dead ends: 112 [2023-02-17 21:40:26,248 INFO L226 Difference]: Without dead ends: 70 [2023-02-17 21:40:26,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=260, Invalid=732, Unknown=0, NotChecked=0, Total=992 [2023-02-17 21:40:26,249 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-17 21:40:26,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 25 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-17 21:40:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-17 21:40:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2023-02-17 21:40:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-02-17 21:40:26,259 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 44 [2023-02-17 21:40:26,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:40:26,259 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-02-17 21:40:26,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-02-17 21:40:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 21:40:26,259 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:40:26,259 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:40:26,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-17 21:40:26,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:40:26,460 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:40:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:40:26,461 INFO L85 PathProgramCache]: Analyzing trace with hash 146952089, now seen corresponding path program 11 times [2023-02-17 21:40:26,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:40:26,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499355729] [2023-02-17 21:40:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:40:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:40:26,479 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:40:26,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832060446] [2023-02-17 21:40:26,479 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 21:40:26,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:40:26,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:40:26,481 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:40:26,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-17 21:40:26,748 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-02-17 21:40:26,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:40:26,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-17 21:40:26,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:40:26,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 21:40:27,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 21:40:27,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:40:27,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-02-17 21:40:27,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:40:27,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-02-17 21:40:27,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:40:27,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:40:27,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:40:27,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:40:28,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2023-02-17 21:40:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 75 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 21:40:28,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:40:28,730 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 21:40:29,095 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:40:29,116 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 21:40:29,136 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ (+ (+ (+ 0 1) 1) 1) 1) 4))))) is different from false [2023-02-17 21:40:32,264 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (v_ArrVal_835 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_255| Int) (v_ArrVal_828 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_255|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_828) (+ (* |v_ULTIMATE.start_main_~i~0#1_255| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_830)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ (+ (+ (+ 0 1) 1) 1) 1) 4))) 3))) is different from false [2023-02-17 21:40:34,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (v_ArrVal_835 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_255| Int) (v_ArrVal_828 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* .cse0 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_828) (+ (* |v_ULTIMATE.start_main_~i~0#1_255| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_830)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ (+ (+ (+ 0 1) 1) 1) 1) 4))) 3) (not (<= (+ .cse0 1) |v_ULTIMATE.start_main_~i~0#1_255|))))) is different from false [2023-02-17 21:40:34,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:40:34,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 141 [2023-02-17 21:40:34,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:40:34,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 174 [2023-02-17 21:40:34,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2023-02-17 21:40:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 47 not checked. [2023-02-17 21:40:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:40:35,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499355729] [2023-02-17 21:40:35,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:40:35,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832060446] [2023-02-17 21:40:35,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832060446] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:40:35,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:40:35,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2023-02-17 21:40:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199904147] [2023-02-17 21:40:35,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:40:35,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 21:40:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:40:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 21:40:35,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=664, Unknown=13, NotChecked=342, Total=1122 [2023-02-17 21:40:35,426 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:40:41,310 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2023-02-17 21:40:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 21:40:41,311 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-17 21:40:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:40:41,311 INFO L225 Difference]: With dead ends: 67 [2023-02-17 21:40:41,311 INFO L226 Difference]: Without dead ends: 55 [2023-02-17 21:40:41,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=147, Invalid=1054, Unknown=13, NotChecked=426, Total=1640 [2023-02-17 21:40:41,312 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-02-17 21:40:41,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 97 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 685 Invalid, 0 Unknown, 261 Unchecked, 4.6s Time] [2023-02-17 21:40:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-17 21:40:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2023-02-17 21:40:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-17 21:40:41,324 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 46 [2023-02-17 21:40:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:40:41,324 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-17 21:40:41,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-17 21:40:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 21:40:41,325 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:40:41,325 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:40:41,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-02-17 21:40:41,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:40:41,529 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:40:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:40:41,529 INFO L85 PathProgramCache]: Analyzing trace with hash 60090633, now seen corresponding path program 12 times [2023-02-17 21:40:41,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:40:41,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486759197] [2023-02-17 21:40:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:40:41,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:40:41,540 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:40:41,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590742259] [2023-02-17 21:40:41,540 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 21:40:41,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:40:41,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:40:41,542 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:40:41,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-17 21:40:41,736 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-02-17 21:40:41,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:40:41,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 21:40:41,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:40:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 92 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:40:42,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:40:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 92 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:40:44,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:40:44,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486759197] [2023-02-17 21:40:44,454 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:40:44,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590742259] [2023-02-17 21:40:44,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590742259] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:40:44,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:40:44,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2023-02-17 21:40:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949832425] [2023-02-17 21:40:44,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:40:44,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-17 21:40:44,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:40:44,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-17 21:40:44,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2023-02-17 21:40:44,457 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:40:46,813 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2023-02-17 21:40:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 21:40:46,814 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-02-17 21:40:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:40:46,814 INFO L225 Difference]: With dead ends: 120 [2023-02-17 21:40:46,814 INFO L226 Difference]: Without dead ends: 75 [2023-02-17 21:40:46,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=324, Invalid=936, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 21:40:46,815 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 84 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-17 21:40:46,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 40 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-17 21:40:46,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-17 21:40:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2023-02-17 21:40:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-02-17 21:40:46,827 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 49 [2023-02-17 21:40:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:40:46,827 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-02-17 21:40:46,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:40:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-02-17 21:40:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-17 21:40:46,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:40:46,828 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:40:46,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-17 21:40:47,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:40:47,033 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:40:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:40:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash -519119029, now seen corresponding path program 13 times [2023-02-17 21:40:47,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:40:47,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493718189] [2023-02-17 21:40:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:40:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:40:47,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:40:47,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305950899] [2023-02-17 21:40:47,046 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 21:40:47,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:40:47,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:40:47,047 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:40:47,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-17 21:40:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:40:47,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-17 21:40:47,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:40:47,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 21:40:47,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 21:40:47,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:40:47,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2023-02-17 21:40:47,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:40:47,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:40:47,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:40:47,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-02-17 21:40:48,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2023-02-17 21:40:48,487 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 35 treesize of output 35 [2023-02-17 21:40:48,643 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 35 treesize of output 35 [2023-02-17 21:40:48,806 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 35 treesize of output 35 [2023-02-17 21:40:48,975 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 35 treesize of output 35 [2023-02-17 21:40:49,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:40:49,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:40:49,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 13 [2023-02-17 21:40:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 46 proven. 103 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 21:40:49,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:40:49,988 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1000) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 21:40:50,010 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1000) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 21:40:50,035 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1000) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:40:50,057 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1000) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 21:40:50,455 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1000) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:40:57,468 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_316| Int)) (or (forall ((v_ArrVal_994 Int) (v_ArrVal_1000 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_315| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_316| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_994)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1000) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_316| 1) |v_ULTIMATE.start_main_~i~0#1_315|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_316|)))) is different from false [2023-02-17 21:40:57,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:40:57,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 183 [2023-02-17 21:40:57,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:40:57,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 232 [2023-02-17 21:40:57,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-02-17 21:40:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 58 not checked. [2023-02-17 21:40:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:40:59,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493718189] [2023-02-17 21:40:59,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:40:59,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305950899] [2023-02-17 21:40:59,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305950899] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:40:59,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:40:59,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2023-02-17 21:40:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593786266] [2023-02-17 21:40:59,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:40:59,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-17 21:40:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:40:59,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-17 21:40:59,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=936, Unknown=16, NotChecked=402, Total=1482 [2023-02-17 21:40:59,170 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:41:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:41:06,793 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2023-02-17 21:41:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 21:41:06,793 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-02-17 21:41:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:41:06,794 INFO L225 Difference]: With dead ends: 68 [2023-02-17 21:41:06,794 INFO L226 Difference]: Without dead ends: 56 [2023-02-17 21:41:06,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=232, Invalid=1846, Unknown=16, NotChecked=558, Total=2652 [2023-02-17 21:41:06,795 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-02-17 21:41:06,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 798 Invalid, 0 Unknown, 265 Unchecked, 5.5s Time] [2023-02-17 21:41:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-17 21:41:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2023-02-17 21:41:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:41:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-02-17 21:41:06,811 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 51 [2023-02-17 21:41:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:41:06,812 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-02-17 21:41:06,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:41:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-02-17 21:41:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 21:41:06,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:41:06,813 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:41:06,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-17 21:41:07,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-17 21:41:07,019 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:41:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:41:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash -115678185, now seen corresponding path program 14 times [2023-02-17 21:41:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:41:07,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193140043] [2023-02-17 21:41:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:41:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:41:07,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:41:07,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56294838] [2023-02-17 21:41:07,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 21:41:07,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:41:07,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:41:07,034 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:41:07,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-17 21:41:07,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 21:41:07,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:41:07,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 21:41:07,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:41:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 117 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:41:08,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:41:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 117 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:41:10,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:41:10,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193140043] [2023-02-17 21:41:10,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:41:10,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56294838] [2023-02-17 21:41:10,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56294838] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:41:10,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:41:10,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2023-02-17 21:41:10,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191547306] [2023-02-17 21:41:10,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:41:10,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-17 21:41:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:41:10,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-17 21:41:10,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2023-02-17 21:41:10,285 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:41:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:41:12,750 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2023-02-17 21:41:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 21:41:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-02-17 21:41:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:41:12,751 INFO L225 Difference]: With dead ends: 128 [2023-02-17 21:41:12,751 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 21:41:12,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2023-02-17 21:41:12,752 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-17 21:41:12,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 36 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-17 21:41:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 21:41:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2023-02-17 21:41:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:41:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-02-17 21:41:12,766 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 54 [2023-02-17 21:41:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:41:12,766 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-02-17 21:41:12,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:41:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-02-17 21:41:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 21:41:12,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:41:12,767 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:41:12,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-17 21:41:12,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-17 21:41:12,973 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:41:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:41:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash -670398699, now seen corresponding path program 15 times [2023-02-17 21:41:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:41:12,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779798927] [2023-02-17 21:41:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:41:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:41:12,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:41:12,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474897042] [2023-02-17 21:41:12,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 21:41:12,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:41:12,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:41:12,992 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:41:13,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-17 21:41:13,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-02-17 21:41:13,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:41:13,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-17 21:41:13,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:41:13,338 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 15 treesize of output 11 [2023-02-17 21:41:13,422 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 29 treesize of output 28 [2023-02-17 21:41:13,498 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 31 treesize of output 30 [2023-02-17 21:41:13,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:41:13,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:41:14,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:41:14,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:41:14,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:41:14,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:41:14,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:41:14,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:41:14,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:41:14,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:41:14,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:41:14,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-17 21:41:14,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:41:14,912 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 27 treesize of output 27 [2023-02-17 21:41:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 39 proven. 123 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 21:41:15,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:41:20,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:41:20,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2023-02-17 21:41:20,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:41:20,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 66 [2023-02-17 21:41:20,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2023-02-17 21:41:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 21:41:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:41:20,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779798927] [2023-02-17 21:41:20,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:41:20,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474897042] [2023-02-17 21:41:20,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474897042] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:41:20,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:41:20,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2023-02-17 21:41:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120201197] [2023-02-17 21:41:20,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:41:20,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-17 21:41:20,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:41:20,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-17 21:41:20,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 21:41:20,723 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:41:24,002 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, 1] [2023-02-17 21:42:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:42:02,624 INFO L93 Difference]: Finished difference Result 169 states and 198 transitions. [2023-02-17 21:42:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-02-17 21:42:02,624 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-02-17 21:42:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:42:02,625 INFO L225 Difference]: With dead ends: 169 [2023-02-17 21:42:02,625 INFO L226 Difference]: Without dead ends: 165 [2023-02-17 21:42:02,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7660 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=4272, Invalid=21166, Unknown=2, NotChecked=0, Total=25440 [2023-02-17 21:42:02,630 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 187 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 133 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2023-02-17 21:42:02,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 73 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1709 Invalid, 1 Unknown, 0 Unchecked, 14.8s Time] [2023-02-17 21:42:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-17 21:42:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 60. [2023-02-17 21:42:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:42:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2023-02-17 21:42:02,646 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 56 [2023-02-17 21:42:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:42:02,646 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2023-02-17 21:42:02,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:42:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2023-02-17 21:42:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-17 21:42:02,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:42:02,647 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:42:02,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-02-17 21:42:02,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:42:02,847 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:42:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:42:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1289304529, now seen corresponding path program 16 times [2023-02-17 21:42:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:42:02,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10511208] [2023-02-17 21:42:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:42:02,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:42:02,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:42:02,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573540861] [2023-02-17 21:42:02,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 21:42:02,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:42:02,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:42:02,862 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:42:02,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-17 21:42:03,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 21:42:03,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:42:03,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 21:42:03,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:42:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:42:04,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:42:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:42:06,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:42:06,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10511208] [2023-02-17 21:42:06,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:42:06,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573540861] [2023-02-17 21:42:06,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573540861] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:42:06,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:42:06,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2023-02-17 21:42:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611548651] [2023-02-17 21:42:06,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:42:06,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-17 21:42:06,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:42:06,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-17 21:42:06,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-02-17 21:42:06,918 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 33 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:42:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:42:09,788 INFO L93 Difference]: Finished difference Result 160 states and 186 transitions. [2023-02-17 21:42:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 21:42:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-02-17 21:42:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:42:09,789 INFO L225 Difference]: With dead ends: 160 [2023-02-17 21:42:09,789 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 21:42:09,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 74 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=473, Invalid=1419, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 21:42:09,790 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-17 21:42:09,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 34 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-17 21:42:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 21:42:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 62. [2023-02-17 21:42:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:42:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-02-17 21:42:09,805 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 59 [2023-02-17 21:42:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:42:09,806 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-02-17 21:42:09,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:42:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-02-17 21:42:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-17 21:42:09,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:42:09,807 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:42:09,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-17 21:42:10,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:42:10,012 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:42:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:42:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1915894381, now seen corresponding path program 17 times [2023-02-17 21:42:10,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:42:10,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935323974] [2023-02-17 21:42:10,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:42:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:42:10,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:42:10,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236096543] [2023-02-17 21:42:10,026 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 21:42:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:42:10,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:42:10,027 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:42:10,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-02-17 21:42:10,559 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-02-17 21:42:10,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:42:10,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-17 21:42:10,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:42:10,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 21:42:10,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 21:42:11,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:42:11,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 78 [2023-02-17 21:42:11,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:42:11,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 78 [2023-02-17 21:42:11,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:42:11,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 78 [2023-02-17 21:42:11,936 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 52 treesize of output 50 [2023-02-17 21:42:12,089 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 52 treesize of output 50 [2023-02-17 21:42:12,249 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 52 treesize of output 50 [2023-02-17 21:42:12,419 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 52 treesize of output 50 [2023-02-17 21:42:12,599 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 52 treesize of output 50 [2023-02-17 21:42:12,783 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 52 treesize of output 50 [2023-02-17 21:42:13,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:42:13,161 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 57 treesize of output 20 [2023-02-17 21:42:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 77 proven. 153 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 21:42:13,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:42:13,970 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) (<= 8 (+ (- 1) 6))) is different from false [2023-02-17 21:42:14,389 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) (<= 8 (+ (- 1) 6))) is different from false [2023-02-17 21:42:14,411 WARN L837 $PredicateComparison]: unable to prove that (or (<= 8 (+ (- 1) 6)) (forall ((v_ArrVal_1379 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2023-02-17 21:42:14,433 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) (<= 8 (+ (- 1) 6))) is different from false [2023-02-17 21:42:14,454 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1379 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (<= 8 (+ (- 1) 6))) is different from false [2023-02-17 21:42:14,475 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1379 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (<= 8 (+ (- 1) 6))) is different from false [2023-02-17 21:42:16,899 WARN L837 $PredicateComparison]: unable to prove that (or (<= 8 (+ (- 1) 6)) (forall ((v_ArrVal_1372 Int) (|v_ULTIMATE.start_main_~i~0#1_456| Int) (v_ArrVal_1379 (Array Int Int))) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_456|)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_456| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1372)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2023-02-17 21:42:18,913 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1370 Int) (v_ArrVal_1372 Int) (|v_ULTIMATE.start_main_~i~0#1_456| Int) (v_ArrVal_1379 (Array Int Int))) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_456|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1370) (+ (* |v_ULTIMATE.start_main_~i~0#1_456| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1372)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3))) (<= 8 (+ (- 1) 6))) is different from false [2023-02-17 21:42:20,923 WARN L837 $PredicateComparison]: unable to prove that (or (<= 8 (+ (- 1) 6)) (forall ((v_ArrVal_1370 Int) (|v_ULTIMATE.start_main_~i~0#1_457| Int) (v_ArrVal_1372 Int) (|v_ULTIMATE.start_main_~i~0#1_456| Int) (v_ArrVal_1379 (Array Int Int))) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_457|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_457| 1) |v_ULTIMATE.start_main_~i~0#1_456|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_457| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1370) (+ (* |v_ULTIMATE.start_main_~i~0#1_456| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1372)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)))) is different from false [2023-02-17 21:42:22,938 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1370 Int) (|v_ULTIMATE.start_main_~i~0#1_457| Int) (v_ArrVal_1372 Int) (|v_ULTIMATE.start_main_~i~0#1_456| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1369 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_457|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1369) (+ (* |v_ULTIMATE.start_main_~i~0#1_457| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1370) (+ (* |v_ULTIMATE.start_main_~i~0#1_456| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1372)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_457| 1) |v_ULTIMATE.start_main_~i~0#1_456|)))) (<= 8 (+ (- 1) 6))) is different from false [2023-02-17 21:42:55,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:42:55,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 342 [2023-02-17 21:42:55,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:42:55,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 381 treesize of output 425 [2023-02-17 21:42:55,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-02-17 21:43:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 73 proven. 42 refuted. 10 times theorem prover too weak. 15 trivial. 105 not checked. [2023-02-17 21:43:03,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:43:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935323974] [2023-02-17 21:43:03,192 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:43:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236096543] [2023-02-17 21:43:03,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236096543] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:43:03,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:43:03,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 38 [2023-02-17 21:43:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150653136] [2023-02-17 21:43:03,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:43:03,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-17 21:43:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:43:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-17 21:43:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=647, Unknown=35, NotChecked=610, Total=1406 [2023-02-17 21:43:03,194 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:43:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:43:11,927 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2023-02-17 21:43:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-17 21:43:11,928 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-02-17 21:43:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:43:11,928 INFO L225 Difference]: With dead ends: 92 [2023-02-17 21:43:11,929 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 21:43:11,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 74 SyntacticMatches, 19 SemanticMatches, 46 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 46.7s TimeCoverageRelationStatistics Valid=174, Invalid=1237, Unknown=35, NotChecked=810, Total=2256 [2023-02-17 21:43:11,930 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 563 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-02-17 21:43:11,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1073 Invalid, 0 Unknown, 563 Unchecked, 6.9s Time] [2023-02-17 21:43:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 21:43:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-02-17 21:43:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.09375) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:43:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2023-02-17 21:43:11,949 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 61 [2023-02-17 21:43:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:43:11,950 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2023-02-17 21:43:11,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:43:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2023-02-17 21:43:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-17 21:43:11,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:43:11,951 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:43:11,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-02-17 21:43:12,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-17 21:43:12,159 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:43:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:43:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1664193239, now seen corresponding path program 18 times [2023-02-17 21:43:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:43:12,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118707031] [2023-02-17 21:43:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:43:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:43:12,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:43:12,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355295549] [2023-02-17 21:43:12,173 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 21:43:12,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:43:12,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:43:12,174 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:43:12,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-02-17 21:43:12,472 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-17 21:43:12,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:43:12,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 21:43:12,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:43:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 176 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:43:14,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:43:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 176 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:43:16,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:43:16,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118707031] [2023-02-17 21:43:16,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:43:16,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355295549] [2023-02-17 21:43:16,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355295549] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:43:16,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:43:16,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2023-02-17 21:43:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443326086] [2023-02-17 21:43:16,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:43:16,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-17 21:43:16,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:43:16,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-17 21:43:16,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 21:43:16,989 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 36 states, 36 states have (on average 2.6666666666666665) internal successors, (96), 36 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:43:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:43:20,662 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2023-02-17 21:43:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 21:43:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.6666666666666665) internal successors, (96), 36 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-02-17 21:43:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:43:20,663 INFO L225 Difference]: With dead ends: 168 [2023-02-17 21:43:20,663 INFO L226 Difference]: Without dead ends: 103 [2023-02-17 21:43:20,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=558, Invalid=1698, Unknown=0, NotChecked=0, Total=2256 [2023-02-17 21:43:20,664 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 135 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-17 21:43:20,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 37 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-02-17 21:43:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-17 21:43:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 67. [2023-02-17 21:43:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:43:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-02-17 21:43:20,684 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 64 [2023-02-17 21:43:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:43:20,685 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-02-17 21:43:20,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.6666666666666665) internal successors, (96), 36 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:43:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-02-17 21:43:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-17 21:43:20,685 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:43:20,685 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:43:20,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-02-17 21:43:20,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-17 21:43:20,892 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:43:20,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:43:20,892 INFO L85 PathProgramCache]: Analyzing trace with hash 392695893, now seen corresponding path program 19 times [2023-02-17 21:43:20,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:43:20,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619715846] [2023-02-17 21:43:20,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:43:20,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:43:20,906 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:43:20,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359147324] [2023-02-17 21:43:20,907 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 21:43:20,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:43:20,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:43:20,908 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:43:20,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-17 21:43:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:43:21,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-17 21:43:21,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:43:21,520 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 15 treesize of output 11 [2023-02-17 21:43:21,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:21,779 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 27 treesize of output 26 [2023-02-17 21:43:22,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:22,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:22,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:22,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2023-02-17 21:43:22,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:22,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:22,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:22,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:22,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:22,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:22,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2023-02-17 21:43:25,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:25,053 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 38 [2023-02-17 21:43:25,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:25,252 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 38 [2023-02-17 21:43:25,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:25,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-02-17 21:43:25,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:25,678 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 38 [2023-02-17 21:43:25,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:25,900 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 38 [2023-02-17 21:43:26,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:26,130 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 38 [2023-02-17 21:43:26,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:26,363 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 38 [2023-02-17 21:43:26,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:26,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:26,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:43:26,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:43:26,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 16 [2023-02-17 21:43:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 88 proven. 194 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 21:43:27,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:43:27,635 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1594 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:43:28,085 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1594 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 21:43:28,106 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1594 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 21:43:29,018 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1594 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 21:43:29,039 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1594 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:43:41,830 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_540| Int)) (or (forall ((v_ArrVal_1587 Int) (|v_ULTIMATE.start_main_~i~0#1_539| Int) (v_ArrVal_1594 (Array Int Int))) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_540| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_539| 4)) v_ArrVal_1587)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_540| 1) |v_ULTIMATE.start_main_~i~0#1_539|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_540|)))) is different from false [2023-02-17 21:44:04,584 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_541| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_541|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_540| Int) (v_ArrVal_1587 Int) (|v_ULTIMATE.start_main_~i~0#1_539| Int) (v_ArrVal_1594 (Array Int Int))) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_541| 4)) 3) (+ (* |v_ULTIMATE.start_main_~i~0#1_540| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_539| 4)) v_ArrVal_1587)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_541| 1) |v_ULTIMATE.start_main_~i~0#1_540|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_540| 1) |v_ULTIMATE.start_main_~i~0#1_539|)))))) is different from false [2023-02-17 21:44:04,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:44:04,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 344 [2023-02-17 21:44:04,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:44:04,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 385 treesize of output 435 [2023-02-17 21:44:04,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-02-17 21:44:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 85 proven. 100 refuted. 0 times theorem prover too weak. 15 trivial. 97 not checked. [2023-02-17 21:44:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:44:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619715846] [2023-02-17 21:44:12,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:44:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359147324] [2023-02-17 21:44:12,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359147324] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:44:12,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:44:12,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2023-02-17 21:44:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883671275] [2023-02-17 21:44:12,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:44:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-17 21:44:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:44:12,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-17 21:44:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1684, Unknown=49, NotChecked=630, Total=2550 [2023-02-17 21:44:12,633 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 51 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:44:23,560 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-17 21:44:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:44:31,564 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-02-17 21:44:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-17 21:44:31,565 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 51 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2023-02-17 21:44:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:44:31,566 INFO L225 Difference]: With dead ends: 86 [2023-02-17 21:44:31,566 INFO L226 Difference]: Without dead ends: 71 [2023-02-17 21:44:31,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=305, Invalid=3092, Unknown=53, NotChecked=840, Total=4290 [2023-02-17 21:44:31,567 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 390 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-02-17 21:44:31,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 138 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1346 Invalid, 1 Unknown, 390 Unchecked, 11.2s Time] [2023-02-17 21:44:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-17 21:44:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2023-02-17 21:44:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:44:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-02-17 21:44:31,591 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 66 [2023-02-17 21:44:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:44:31,592 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-02-17 21:44:31,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 51 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:44:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-02-17 21:44:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-17 21:44:31,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:44:31,592 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:44:31,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-02-17 21:44:31,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-17 21:44:31,793 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:44:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:44:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1565735125, now seen corresponding path program 20 times [2023-02-17 21:44:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:44:31,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428908575] [2023-02-17 21:44:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:44:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:44:31,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:44:31,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685014888] [2023-02-17 21:44:31,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 21:44:31,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:44:31,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:44:31,813 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:44:31,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-02-17 21:44:31,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 21:44:31,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:44:31,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 21:44:31,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:44:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 210 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:44:34,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:44:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 210 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:44:37,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:44:37,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428908575] [2023-02-17 21:44:37,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:44:37,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685014888] [2023-02-17 21:44:37,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685014888] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:44:37,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:44:37,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 39 [2023-02-17 21:44:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839916977] [2023-02-17 21:44:37,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:44:37,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-17 21:44:37,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:44:37,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-17 21:44:37,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2023-02-17 21:44:37,258 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:44:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:44:40,696 INFO L93 Difference]: Finished difference Result 176 states and 202 transitions. [2023-02-17 21:44:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-17 21:44:40,697 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2023-02-17 21:44:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:44:40,698 INFO L225 Difference]: With dead ends: 176 [2023-02-17 21:44:40,698 INFO L226 Difference]: Without dead ends: 108 [2023-02-17 21:44:40,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 86 SyntacticMatches, 13 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2023-02-17 21:44:40,699 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-17 21:44:40,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 41 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-02-17 21:44:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-17 21:44:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2023-02-17 21:44:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:44:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2023-02-17 21:44:40,722 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 69 [2023-02-17 21:44:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:44:40,722 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2023-02-17 21:44:40,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:44:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2023-02-17 21:44:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-17 21:44:40,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:44:40,723 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:44:40,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-02-17 21:44:40,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-17 21:44:40,929 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:44:40,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:44:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash -5932521, now seen corresponding path program 21 times [2023-02-17 21:44:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:44:40,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490460771] [2023-02-17 21:44:40,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:44:40,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:44:40,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:44:40,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398724707] [2023-02-17 21:44:40,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 21:44:40,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:44:40,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:44:40,944 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:44:40,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-02-17 21:44:41,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2023-02-17 21:44:41,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:44:41,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-17 21:44:41,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:44:41,440 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 15 treesize of output 11 [2023-02-17 21:44:41,508 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 29 treesize of output 28 [2023-02-17 21:44:41,570 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 31 treesize of output 30 [2023-02-17 21:44:41,643 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 32 [2023-02-17 21:44:41,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:44:42,000 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 24 treesize of output 26 [2023-02-17 21:44:42,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:44:42,024 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 24 treesize of output 26 [2023-02-17 21:44:42,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:44:42,047 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 24 treesize of output 26 [2023-02-17 21:44:42,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:44:42,072 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 24 treesize of output 26 [2023-02-17 21:44:42,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:44:42,096 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 24 treesize of output 26 [2023-02-17 21:44:42,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:44:42,121 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 24 treesize of output 26 [2023-02-17 21:44:42,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:44:42,145 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 24 treesize of output 26 [2023-02-17 21:44:42,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:44:42,170 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 24 treesize of output 26 [2023-02-17 21:44:42,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:44:42,315 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 29 treesize of output 29 [2023-02-17 21:44:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 68 proven. 145 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-02-17 21:44:43,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:44:43,990 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse0 (+ (- 1) c_~N~0))) (or (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1826) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= .cse0 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 4) .cse0)))) is different from false [2023-02-17 21:44:46,464 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1818 Int) (|v_ULTIMATE.start_main_~i~0#1_619| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_main_~i~0#1_619| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (or (< .cse0 .cse1) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1818)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1826) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_619| 4)))) (< .cse1 .cse0)))) is different from false [2023-02-17 21:44:53,933 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1818 Int) (|v_ULTIMATE.start_main_~i~0#1_619| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse2 (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1))) (let ((.cse1 (+ .cse2 1)) (.cse0 (+ |v_ULTIMATE.start_main_~i~0#1_619| 4))) (or (< .cse0 .cse1) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* .cse2 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1818)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1826) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_619| 4))) 3) (< .cse1 .cse0))))) is different from false [2023-02-17 21:44:55,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:44:55,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 59 [2023-02-17 21:44:55,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:44:55,535 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 42 [2023-02-17 21:44:55,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-02-17 21:44:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 8 proven. 49 refuted. 26 times theorem prover too weak. 141 trivial. 130 not checked. [2023-02-17 21:44:59,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:44:59,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490460771] [2023-02-17 21:44:59,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:44:59,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398724707] [2023-02-17 21:44:59,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398724707] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:44:59,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:44:59,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2023-02-17 21:44:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696262858] [2023-02-17 21:44:59,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:44:59,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 21:44:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:44:59,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 21:44:59,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=502, Unknown=19, NotChecked=144, Total=756 [2023-02-17 21:44:59,729 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:45:07,136 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-17 21:45:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:45:16,325 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2023-02-17 21:45:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-17 21:45:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-02-17 21:45:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:45:16,327 INFO L225 Difference]: With dead ends: 105 [2023-02-17 21:45:16,327 INFO L226 Difference]: Without dead ends: 101 [2023-02-17 21:45:16,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 107 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=901, Invalid=3380, Unknown=21, NotChecked=390, Total=4692 [2023-02-17 21:45:16,328 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-02-17 21:45:16,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 52 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 810 Invalid, 1 Unknown, 156 Unchecked, 8.0s Time] [2023-02-17 21:45:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-17 21:45:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2023-02-17 21:45:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:45:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-02-17 21:45:16,352 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 71 [2023-02-17 21:45:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:45:16,353 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-02-17 21:45:16,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:45:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-02-17 21:45:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-17 21:45:16,353 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:45:16,354 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:45:16,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-02-17 21:45:16,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:45:16,562 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:45:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:45:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 896946063, now seen corresponding path program 22 times [2023-02-17 21:45:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:45:16,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369910090] [2023-02-17 21:45:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:45:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:45:16,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:45:16,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503517325] [2023-02-17 21:45:16,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 21:45:16,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:45:16,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:45:16,579 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:45:16,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-02-17 21:45:16,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 21:45:16,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:45:16,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 21:45:16,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:45:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 247 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:45:19,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:45:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 247 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:45:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:45:23,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369910090] [2023-02-17 21:45:23,427 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:45:23,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503517325] [2023-02-17 21:45:23,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503517325] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:45:23,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:45:23,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 42 [2023-02-17 21:45:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252381303] [2023-02-17 21:45:23,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:45:23,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-17 21:45:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:45:23,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-17 21:45:23,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2023-02-17 21:45:23,428 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 42 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 42 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:45:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:45:27,437 INFO L93 Difference]: Finished difference Result 214 states and 251 transitions. [2023-02-17 21:45:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 21:45:27,437 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 42 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-02-17 21:45:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:45:27,438 INFO L225 Difference]: With dead ends: 214 [2023-02-17 21:45:27,438 INFO L226 Difference]: Without dead ends: 129 [2023-02-17 21:45:27,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 92 SyntacticMatches, 14 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=749, Invalid=2331, Unknown=0, NotChecked=0, Total=3080 [2023-02-17 21:45:27,439 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 191 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-17 21:45:27,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 32 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-17 21:45:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-17 21:45:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 77. [2023-02-17 21:45:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:45:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-17 21:45:27,466 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 74 [2023-02-17 21:45:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:45:27,466 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-17 21:45:27,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 42 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:45:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-17 21:45:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-17 21:45:27,467 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:45:27,467 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:45:27,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-02-17 21:45:27,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:45:27,673 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:45:27,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:45:27,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1845196915, now seen corresponding path program 23 times [2023-02-17 21:45:27,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:45:27,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167507858] [2023-02-17 21:45:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:45:27,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:45:27,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:45:27,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726037993] [2023-02-17 21:45:27,694 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 21:45:27,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:45:27,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:45:27,695 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:45:27,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-02-17 21:45:29,566 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2023-02-17 21:45:29,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:45:29,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-17 21:45:29,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:45:29,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 21:45:30,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 21:45:30,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:45:30,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 70 [2023-02-17 21:45:30,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:45:30,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 70 [2023-02-17 21:45:31,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:45:31,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 70 [2023-02-17 21:45:31,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:45:31,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 70 [2023-02-17 21:45:31,839 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 48 treesize of output 46 [2023-02-17 21:45:32,040 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 48 treesize of output 46 [2023-02-17 21:45:32,250 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 48 treesize of output 46 [2023-02-17 21:45:32,466 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 48 treesize of output 46 [2023-02-17 21:45:32,694 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 48 treesize of output 46 [2023-02-17 21:45:32,930 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 48 treesize of output 46 [2023-02-17 21:45:33,171 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 48 treesize of output 46 [2023-02-17 21:45:33,417 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 48 treesize of output 46 [2023-02-17 21:45:33,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:45:33,903 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 53 treesize of output 20 [2023-02-17 21:45:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 130 proven. 260 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-17 21:45:34,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:45:35,527 WARN L837 $PredicateComparison]: unable to prove that (or (<= 11 (+ (- 1) 8)) (forall ((v_ArrVal_2077 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2023-02-17 21:45:35,554 WARN L837 $PredicateComparison]: unable to prove that (or (<= 11 (+ (- 1) 8)) (forall ((v_ArrVal_2077 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2023-02-17 21:45:36,144 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2077 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (<= 11 (+ (- 1) 8))) is different from false [2023-02-17 21:45:36,706 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2077 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) (<= 11 (+ (- 1) 8))) is different from false [2023-02-17 21:45:40,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-02-17 21:45:40,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-02-17 21:45:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 124 proven. 186 refuted. 0 times theorem prover too weak. 32 trivial. 74 not checked. [2023-02-17 21:45:41,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:45:41,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167507858] [2023-02-17 21:45:41,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:45:41,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726037993] [2023-02-17 21:45:41,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726037993] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:45:41,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:45:41,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 41 [2023-02-17 21:45:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767816046] [2023-02-17 21:45:41,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:45:41,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-17 21:45:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:45:41,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-17 21:45:41,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1197, Unknown=6, NotChecked=292, Total=1640 [2023-02-17 21:45:41,064 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 41 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:45:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:45:54,734 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2023-02-17 21:45:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-17 21:45:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-02-17 21:45:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:45:54,735 INFO L225 Difference]: With dead ends: 120 [2023-02-17 21:45:54,735 INFO L226 Difference]: Without dead ends: 102 [2023-02-17 21:45:54,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 94 SyntacticMatches, 21 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=231, Invalid=2229, Unknown=6, NotChecked=396, Total=2862 [2023-02-17 21:45:54,744 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-02-17 21:45:54,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 114 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1632 Invalid, 0 Unknown, 264 Unchecked, 11.4s Time] [2023-02-17 21:45:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-17 21:45:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2023-02-17 21:45:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:45:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-02-17 21:45:54,776 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 76 [2023-02-17 21:45:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:45:54,776 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-02-17 21:45:54,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:45:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-02-17 21:45:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-02-17 21:45:54,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:45:54,776 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:45:54,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-02-17 21:45:54,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-02-17 21:45:54,977 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:45:54,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:45:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash 147300245, now seen corresponding path program 24 times [2023-02-17 21:45:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:45:54,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103967617] [2023-02-17 21:45:54,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:45:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:45:54,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:45:54,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903246384] [2023-02-17 21:45:54,994 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 21:45:54,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:45:54,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:45:54,997 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:45:55,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-02-17 21:45:55,902 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2023-02-17 21:45:55,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:45:55,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 21:45:55,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:45:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 287 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:45:59,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:46:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 287 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 21:46:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:46:03,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103967617] [2023-02-17 21:46:03,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:46:03,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903246384] [2023-02-17 21:46:03,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903246384] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:46:03,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:46:03,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 45 [2023-02-17 21:46:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081880846] [2023-02-17 21:46:03,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:46:03,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-17 21:46:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:46:03,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-17 21:46:03,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1501, Unknown=0, NotChecked=0, Total=1980 [2023-02-17 21:46:03,581 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:46:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:46:08,031 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2023-02-17 21:46:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-17 21:46:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2023-02-17 21:46:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:46:08,033 INFO L225 Difference]: With dead ends: 222 [2023-02-17 21:46:08,033 INFO L226 Difference]: Without dead ends: 134 [2023-02-17 21:46:08,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 98 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=855, Invalid=2685, Unknown=0, NotChecked=0, Total=3540 [2023-02-17 21:46:08,034 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 152 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-17 21:46:08,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 43 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-02-17 21:46:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-17 21:46:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 82. [2023-02-17 21:46:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:46:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-02-17 21:46:08,062 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 79 [2023-02-17 21:46:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:46:08,062 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-02-17 21:46:08,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 21:46:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-02-17 21:46:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-17 21:46:08,063 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:46:08,063 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 21:46:08,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-02-17 21:46:08,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:46:08,272 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:46:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:46:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash -520964521, now seen corresponding path program 25 times [2023-02-17 21:46:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:46:08,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275851602] [2023-02-17 21:46:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:46:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:46:08,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:46:08,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116261804] [2023-02-17 21:46:08,288 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 21:46:08,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:46:08,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:46:08,290 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 21:46:08,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-02-17 21:46:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:46:08,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-17 21:46:08,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:46:08,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 21:46:09,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 21:46:09,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:09,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 21:46:09,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:09,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:09,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:09,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2023-02-17 21:46:10,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:10,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:10,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:10,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2023-02-17 21:46:10,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:10,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:10,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:10,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:10,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:10,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:10,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2023-02-17 21:46:13,889 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 38 [2023-02-17 21:46:14,127 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 38 [2023-02-17 21:46:14,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-02-17 21:46:14,636 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 38 [2023-02-17 21:46:14,901 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 38 [2023-02-17 21:46:15,173 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 38 [2023-02-17 21:46:15,454 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 38 [2023-02-17 21:46:15,747 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 38 [2023-02-17 21:46:16,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-02-17 21:46:16,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:16,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:16,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:46:16,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:46:16,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 16 [2023-02-17 21:46:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 143 proven. 314 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-17 21:46:17,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:46:18,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2345 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 21:46:19,992 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:46:20,631 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 4 (+ (+ (+ (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 1) 1) 1)) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:46:20,653 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2023-02-17 21:46:20,676 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ (+ (+ (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 1) 1) 1) 4))) 3)) is different from false [2023-02-17 21:46:41,816 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_825| Int)) (or (forall ((v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2335 Int) (|v_ULTIMATE.start_main_~i~0#1_824| Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_825| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (+ (* |v_ULTIMATE.start_main_~i~0#1_824| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2335)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ (+ (+ (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 1) 1) 1) 4)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_825| 1) |v_ULTIMATE.start_main_~i~0#1_824|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_825|)))) is different from false [2023-02-17 21:46:43,832 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2331 Int) (v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2335 Int) (|v_ULTIMATE.start_main_~i~0#1_825| Int) (|v_ULTIMATE.start_main_~i~0#1_824| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2331) (+ (* |v_ULTIMATE.start_main_~i~0#1_825| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (+ (* |v_ULTIMATE.start_main_~i~0#1_824| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2335)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ (+ (+ (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 1) 1) 1) 4))) 3) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_825| 1) |v_ULTIMATE.start_main_~i~0#1_824|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_825|)))) is different from false [2023-02-17 21:46:45,986 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_826| Int)) (or (forall ((v_ArrVal_2331 Int) (v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2335 Int) (|v_ULTIMATE.start_main_~i~0#1_825| Int) (|v_ULTIMATE.start_main_~i~0#1_824| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_826| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2331) (+ (* |v_ULTIMATE.start_main_~i~0#1_825| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (+ (* |v_ULTIMATE.start_main_~i~0#1_824| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2335)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ (+ (+ (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 1) 1) 1) 4))) 3) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_826| 1) |v_ULTIMATE.start_main_~i~0#1_825|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_825| 1) |v_ULTIMATE.start_main_~i~0#1_824|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_826|)))) is different from false [2023-02-17 21:47:06,684 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_827| Int)) (or (forall ((v_ArrVal_2331 Int) (v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_826| Int) (v_ArrVal_2335 Int) (|v_ULTIMATE.start_main_~i~0#1_825| Int) (|v_ULTIMATE.start_main_~i~0#1_824| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_826| 1) |v_ULTIMATE.start_main_~i~0#1_825|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_827| 1) |v_ULTIMATE.start_main_~i~0#1_826|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_825| 1) |v_ULTIMATE.start_main_~i~0#1_824|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_827| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (+ (* |v_ULTIMATE.start_main_~i~0#1_826| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2331) (+ (* |v_ULTIMATE.start_main_~i~0#1_825| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (+ (* |v_ULTIMATE.start_main_~i~0#1_824| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2335)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (+ (+ (+ (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 1) 1) 1) 4))) 3))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_827|)))) is different from false [2023-02-17 21:47:06,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:47:06,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 577 [2023-02-17 21:47:06,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 21:47:06,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 630 treesize of output 726