./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s42if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/s42if.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 7a409beec5345d23de858b9cfc2d898f0f9067f3e0e10973225e4b6022343f4a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:15:56,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:15:56,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:15:56,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:15:56,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:15:56,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:15:56,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:15:56,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:15:56,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:15:56,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:15:56,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:15:56,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:15:56,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:15:56,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:15:56,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:15:56,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:15:56,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:15:56,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:15:56,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:15:56,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:15:56,216 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:15:56,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:15:56,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:15:56,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:15:56,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:15:56,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:15:56,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:15:56,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:15:56,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:15:56,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:15:56,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:15:56,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:15:56,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:15:56,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:15:56,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:15:56,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:15:56,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:15:56,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:15:56,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:15:56,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:15:56,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:15:56,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:15:56,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:15:56,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:15:56,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:15:56,250 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:15:56,250 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:15:56,251 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:15:56,251 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:15:56,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:15:56,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:15:56,252 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:15:56,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:15:56,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:15:56,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:15:56,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:15:56,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:15:56,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:15:56,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:15:56,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:15:56,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:15:56,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:15:56,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:15:56,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:15:56,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:15:56,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:15:56,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:15:56,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:15:56,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:15:56,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:15:56,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:15:56,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:15:56,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:15:56,256 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:15:56,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:15:56,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:15:56,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 7a409beec5345d23de858b9cfc2d898f0f9067f3e0e10973225e4b6022343f4a [2022-07-13 11:15:56,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:15:56,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:15:56,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:15:56,464 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:15:56,465 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:15:56,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s42if.c [2022-07-13 11:15:56,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d87b04f/dfffdef6b9ea4b5b9872debf344cf09b/FLAGd2272bb24 [2022-07-13 11:15:56,846 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:15:56,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s42if.c [2022-07-13 11:15:56,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d87b04f/dfffdef6b9ea4b5b9872debf344cf09b/FLAGd2272bb24 [2022-07-13 11:15:57,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d87b04f/dfffdef6b9ea4b5b9872debf344cf09b [2022-07-13 11:15:57,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:15:57,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:15:57,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:15:57,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:15:57,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:15:57,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aab3aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57, skipping insertion in model container [2022-07-13 11:15:57,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:15:57,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:15:57,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s42if.c[588,601] [2022-07-13 11:15:57,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:15:57,436 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:15:57,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s42if.c[588,601] [2022-07-13 11:15:57,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:15:57,475 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:15:57,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57 WrapperNode [2022-07-13 11:15:57,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:15:57,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:15:57,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:15:57,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:15:57,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,499 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2022-07-13 11:15:57,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:15:57,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:15:57,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:15:57,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:15:57,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:15:57,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:15:57,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:15:57,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:15:57,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (1/1) ... [2022-07-13 11:15:57,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:15:57,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:57,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:15:57,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:15:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:15:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:15:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:15:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:15:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:15:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:15:57,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:15:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:15:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:15:57,624 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:15:57,625 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:15:57,768 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:15:57,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:15:57,772 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 11:15:57,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:15:57 BoogieIcfgContainer [2022-07-13 11:15:57,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:15:57,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:15:57,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:15:57,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:15:57,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:15:57" (1/3) ... [2022-07-13 11:15:57,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc0c434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:15:57, skipping insertion in model container [2022-07-13 11:15:57,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:15:57" (2/3) ... [2022-07-13 11:15:57,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc0c434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:15:57, skipping insertion in model container [2022-07-13 11:15:57,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:15:57" (3/3) ... [2022-07-13 11:15:57,780 INFO L111 eAbstractionObserver]: Analyzing ICFG s42if.c [2022-07-13 11:15:57,789 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:15:57,790 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:15:57,820 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:15:57,826 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@532fa22f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4756a57f [2022-07-13 11:15:57,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:15:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 11:15:57,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:57,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:57,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2022-07-13 11:15:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:57,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297120871] [2022-07-13 11:15:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:15:57,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:58,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297120871] [2022-07-13 11:15:58,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297120871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:15:58,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:15:58,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:15:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089845014] [2022-07-13 11:15:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:15:58,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:15:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:15:58,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:15:58,031 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:58,043 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-07-13 11:15:58,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:15:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 11:15:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:58,050 INFO L225 Difference]: With dead ends: 42 [2022-07-13 11:15:58,051 INFO L226 Difference]: Without dead ends: 19 [2022-07-13 11:15:58,053 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 [2022-07-13 11:15:58,059 INFO L413 NwaCegarLoop]: 28 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, 28 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 [2022-07-13 11:15:58,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:15:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-13 11:15:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 11:15:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-13 11:15:58,079 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2022-07-13 11:15:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:58,079 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-13 11:15:58,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-13 11:15:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 11:15:58,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:58,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:58,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:15:58,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2022-07-13 11:15:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:58,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936074442] [2022-07-13 11:15:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:15:58,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:58,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936074442] [2022-07-13 11:15:58,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936074442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:15:58,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:15:58,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:15:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852236875] [2022-07-13 11:15:58,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:15:58,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:15:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:15:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:15:58,133 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:58,217 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-07-13 11:15:58,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:15:58,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 11:15:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:58,218 INFO L225 Difference]: With dead ends: 39 [2022-07-13 11:15:58,218 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 11:15:58,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:15:58,219 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:58,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:15:58,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 11:15:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-13 11:15:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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) [2022-07-13 11:15:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-13 11:15:58,224 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-13 11:15:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:58,224 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-13 11:15:58,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-13 11:15:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:15:58,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:58,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:58,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:15:58,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:58,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2022-07-13 11:15:58,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:58,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657217838] [2022-07-13 11:15:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:15:58,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:58,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657217838] [2022-07-13 11:15:58,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657217838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:15:58,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554641311] [2022-07-13 11:15:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:58,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:15:58,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:15:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:58,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:15:58,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:15:58,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:15:58,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:15:58,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:15:58,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:15:58,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:15:58,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-07-13 11:15:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:15:58,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:58,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_46 (Array Int Int))) (let ((.cse2 (select v_ArrVal_46 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (let ((.cse1 (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse0 (* c_~N~0 5))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse2 5))))) is different from false [2022-07-13 11:15:59,166 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:15:59,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-13 11:15:59,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:15:59,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-13 11:15:59,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:15:59,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-13 11:15:59,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-13 11:15:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 11:15:59,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554641311] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:59,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:15:59,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-07-13 11:15:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581190403] [2022-07-13 11:15:59,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:59,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:15:59,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:59,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:15:59,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2022-07-13 11:15:59,206 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:59,447 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-13 11:15:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:15:59,448 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 11:15:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:59,448 INFO L225 Difference]: With dead ends: 41 [2022-07-13 11:15:59,448 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 11:15:59,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=418, Unknown=1, NotChecked=44, Total=600 [2022-07-13 11:15:59,449 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:59,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 61 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2022-07-13 11:15:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 11:15:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-13 11:15:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-13 11:15:59,453 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-07-13 11:15:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:59,453 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-13 11:15:59,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-13 11:15:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:15:59,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:59,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:59,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:15:59,660 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 [2022-07-13 11:15:59,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2022-07-13 11:15:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:59,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049073431] [2022-07-13 11:15:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:59,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:15:59,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584749251] [2022-07-13 11:15:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:59,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:59,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:59,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:15:59,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:15:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:59,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 11:15:59,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:15:59,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-13 11:15:59,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 11:15:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:15:59,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:59,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-07-13 11:15:59,809 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:15:59,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2022-07-13 11:15:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:15:59,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:59,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049073431] [2022-07-13 11:15:59,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:15:59,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584749251] [2022-07-13 11:15:59,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584749251] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:59,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:15:59,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-07-13 11:15:59,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990571619] [2022-07-13 11:15:59,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:59,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:15:59,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:59,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:15:59,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:15:59,820 INFO L87 Difference]: Start difference. First operand 33 states and 41 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) [2022-07-13 11:15:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:59,939 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-07-13 11:15:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:15:59,939 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 21 [2022-07-13 11:15:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:59,941 INFO L225 Difference]: With dead ends: 58 [2022-07-13 11:15:59,941 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 11:15:59,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:15:59,942 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:59,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 63 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:15:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 11:15:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2022-07-13 11:15:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-07-13 11:15:59,947 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2022-07-13 11:15:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:59,948 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-13 11:15:59,948 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) [2022-07-13 11:15:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-07-13 11:15:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:15:59,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:59,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:59,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:00,163 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 [2022-07-13 11:16:00,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:00,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2022-07-13 11:16:00,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:00,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044968318] [2022-07-13 11:16:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:16:00,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:00,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044968318] [2022-07-13 11:16:00,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044968318] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:00,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304671736] [2022-07-13 11:16:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:00,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:00,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:00,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:00,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:16:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:00,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:16:00,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:00,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:16:00,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 11:16:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:16:00,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:00,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-13 11:16:00,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-13 11:16:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:16:00,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304671736] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:00,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:00,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2022-07-13 11:16:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396417162] [2022-07-13 11:16:00,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:00,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:16:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:16:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:16:00,463 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:00,920 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-07-13 11:16:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:16:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 11:16:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:00,921 INFO L225 Difference]: With dead ends: 86 [2022-07-13 11:16:00,921 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 11:16:00,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 11:16:00,922 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:00,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 83 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:16:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 11:16:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-07-13 11:16:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 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) [2022-07-13 11:16:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-07-13 11:16:00,928 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2022-07-13 11:16:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:00,928 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-07-13 11:16:00,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-07-13 11:16:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 11:16:00,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:00,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:00,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:01,155 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 [2022-07-13 11:16:01,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:01,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2022-07-13 11:16:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:01,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155090188] [2022-07-13 11:16:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:01,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:16:01,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:01,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155090188] [2022-07-13 11:16:01,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155090188] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:01,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034115886] [2022-07-13 11:16:01,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:16:01,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:01,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:01,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:01,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:16:01,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:16:01,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:01,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:16:01,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:16:01,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:16:01,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034115886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:01,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:01,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:16:01,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321655430] [2022-07-13 11:16:01,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:01,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:16:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:16:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:16:01,339 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:01,462 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-07-13 11:16:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:16:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-13 11:16:01,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:01,463 INFO L225 Difference]: With dead ends: 85 [2022-07-13 11:16:01,463 INFO L226 Difference]: Without dead ends: 75 [2022-07-13 11:16:01,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:16:01,464 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:01,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 26 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:16:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-13 11:16:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-07-13 11:16:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-07-13 11:16:01,470 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2022-07-13 11:16:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:01,471 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-07-13 11:16:01,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-07-13 11:16:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:16:01,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:01,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:01,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:01,688 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 [2022-07-13 11:16:01,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2022-07-13 11:16:01,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:01,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386959638] [2022-07-13 11:16:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:16:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386959638] [2022-07-13 11:16:01,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386959638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:01,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452991828] [2022-07-13 11:16:01,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:16:01,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:01,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:01,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:01,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:16:01,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:16:01,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:01,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:16:01,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:16:01,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:16:01,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452991828] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:01,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:01,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:16:01,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637273774] [2022-07-13 11:16:01,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:01,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:16:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:16:01,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:16:01,851 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:01,931 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-07-13 11:16:01,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:16:01,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 11:16:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:01,932 INFO L225 Difference]: With dead ends: 78 [2022-07-13 11:16:01,932 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 11:16:01,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:16:01,933 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:01,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:16:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 11:16:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-07-13 11:16:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-13 11:16:01,936 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2022-07-13 11:16:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:01,937 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-13 11:16:01,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-13 11:16:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:16:01,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:01,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:01,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:02,151 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 [2022-07-13 11:16:02,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:02,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2022-07-13 11:16:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:02,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73813930] [2022-07-13 11:16:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:16:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:02,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73813930] [2022-07-13 11:16:02,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73813930] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:02,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805558354] [2022-07-13 11:16:02,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:16:02,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:02,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:02,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:02,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:16:02,447 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:16:02,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:02,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 11:16:02,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:02,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:16:02,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:02,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:02,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:02,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:02,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:02,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:02,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:02,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:02,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:02,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:16:02,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:02,767 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:02,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 41 [2022-07-13 11:16:02,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:02,855 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:02,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-07-13 11:16:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:16:02,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:03,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (let ((.cse3 (* c_~N~0 5)) (.cse2 (+ .cse4 .cse0 .cse1))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))))) is different from false [2022-07-13 11:16:04,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= 5 .cse0)) (let ((.cse2 (* 5 ~N~0)) (.cse1 (+ .cse3 .cse4 .cse0))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse3 5)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:16:04,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= 5 .cse0)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (let ((.cse2 (* 5 ~N~0)) (.cse1 (+ .cse3 .cse4 .cse0))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse3 5)))))))) is different from false [2022-07-13 11:16:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-07-13 11:16:04,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805558354] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:04,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:04,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2022-07-13 11:16:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250263014] [2022-07-13 11:16:04,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:04,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 11:16:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 11:16:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056 [2022-07-13 11:16:04,690 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:05,344 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-07-13 11:16:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 11:16:05,344 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 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 [2022-07-13 11:16:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:05,345 INFO L225 Difference]: With dead ends: 83 [2022-07-13 11:16:05,345 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 11:16:05,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=274, Invalid=1457, Unknown=3, NotChecked=246, Total=1980 [2022-07-13 11:16:05,346 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:05,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 119 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 331 Invalid, 0 Unknown, 430 Unchecked, 0.2s Time] [2022-07-13 11:16:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 11:16:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2022-07-13 11:16:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-07-13 11:16:05,353 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 29 [2022-07-13 11:16:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:05,354 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-07-13 11:16:05,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-07-13 11:16:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:16:05,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:05,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:05,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:05,571 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 [2022-07-13 11:16:05,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:05,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2022-07-13 11:16:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:05,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073537539] [2022-07-13 11:16:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:05,583 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:16:05,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285570931] [2022-07-13 11:16:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:05,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:05,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:05,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:05,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:16:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:05,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 11:16:05,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:05,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-07-13 11:16:05,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:05,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:16:05,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:16:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:16:05,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:05,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-13 11:16:05,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-13 11:16:05,792 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:16:05,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-07-13 11:16:05,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:16:05,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-13 11:16:05,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:16:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-07-13 11:16:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:05,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073537539] [2022-07-13 11:16:05,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:16:05,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285570931] [2022-07-13 11:16:05,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285570931] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:05,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:16:05,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-13 11:16:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572890995] [2022-07-13 11:16:05,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:05,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:16:05,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:05,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:16:05,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2022-07-13 11:16:05,852 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:06,044 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2022-07-13 11:16:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:16:06,044 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 11:16:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:06,045 INFO L225 Difference]: With dead ends: 109 [2022-07-13 11:16:06,045 INFO L226 Difference]: Without dead ends: 102 [2022-07-13 11:16:06,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=293, Unknown=2, NotChecked=74, Total=462 [2022-07-13 11:16:06,045 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:06,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 113 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 220 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2022-07-13 11:16:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-13 11:16:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2022-07-13 11:16:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 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) [2022-07-13 11:16:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-07-13 11:16:06,057 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 29 [2022-07-13 11:16:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:06,057 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-07-13 11:16:06,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-07-13 11:16:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:16:06,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:06,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:06,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:06,271 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 [2022-07-13 11:16:06,271 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2022-07-13 11:16:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:06,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124836837] [2022-07-13 11:16:06,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:06,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:16:06,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712607965] [2022-07-13 11:16:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:06,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:06,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:06,285 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:06,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:16:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:06,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 11:16:06,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:06,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:16:06,362 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:16:06,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:16:06,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:16:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:16:06,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:06,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-13 11:16:06,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-13 11:16:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:16:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:06,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124836837] [2022-07-13 11:16:06,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:16:06,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712607965] [2022-07-13 11:16:06,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712607965] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:06,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:16:06,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-13 11:16:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442380502] [2022-07-13 11:16:06,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:06,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:16:06,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:06,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:16:06,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:16:06,415 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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) [2022-07-13 11:16:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:06,514 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2022-07-13 11:16:06,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:16:06,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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 29 [2022-07-13 11:16:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:06,515 INFO L225 Difference]: With dead ends: 123 [2022-07-13 11:16:06,515 INFO L226 Difference]: Without dead ends: 91 [2022-07-13 11:16:06,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:16:06,515 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:06,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:16:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-13 11:16:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2022-07-13 11:16:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 81 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2022-07-13 11:16:06,522 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 29 [2022-07-13 11:16:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:06,522 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2022-07-13 11:16:06,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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) [2022-07-13 11:16:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2022-07-13 11:16:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 11:16:06,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:06,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:06,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:06,737 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 [2022-07-13 11:16:06,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2022-07-13 11:16:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:06,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267834641] [2022-07-13 11:16:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:16:06,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:06,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267834641] [2022-07-13 11:16:06,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267834641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:06,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103080026] [2022-07-13 11:16:06,802 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:16:06,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:06,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:06,804 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:06,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:16:06,859 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:16:06,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:06,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:16:06,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:16:06,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:16:06,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103080026] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:06,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:06,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:16:06,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829699433] [2022-07-13 11:16:06,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:06,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:16:06,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:06,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:16:06,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:16:06,943 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:07,108 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2022-07-13 11:16:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:16:07,108 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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 31 [2022-07-13 11:16:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:07,109 INFO L225 Difference]: With dead ends: 110 [2022-07-13 11:16:07,109 INFO L226 Difference]: Without dead ends: 97 [2022-07-13 11:16:07,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:16:07,110 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 75 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:07,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 30 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:16:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-13 11:16:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2022-07-13 11:16:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2022-07-13 11:16:07,134 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 31 [2022-07-13 11:16:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:07,134 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2022-07-13 11:16:07,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-07-13 11:16:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:16:07,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:07,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:07,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:07,351 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 [2022-07-13 11:16:07,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2022-07-13 11:16:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:07,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565045184] [2022-07-13 11:16:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:16:07,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:07,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565045184] [2022-07-13 11:16:07,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565045184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:07,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291779426] [2022-07-13 11:16:07,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:16:07,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:07,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:07,415 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:07,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:16:07,467 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 11:16:07,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:07,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:16:07,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:16:07,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:16:07,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291779426] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:07,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:07,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:16:07,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312254021] [2022-07-13 11:16:07,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:07,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:16:07,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:16:07,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:16:07,556 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:07,664 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-07-13 11:16:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:16:07,664 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-13 11:16:07,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:07,665 INFO L225 Difference]: With dead ends: 101 [2022-07-13 11:16:07,665 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 11:16:07,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:16:07,665 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:07,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 27 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:16:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 11:16:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-07-13 11:16:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-13 11:16:07,669 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2022-07-13 11:16:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:07,669 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-13 11:16:07,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-13 11:16:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:16:07,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:07,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:07,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:07,886 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 [2022-07-13 11:16:07,886 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:07,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2022-07-13 11:16:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:07,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669899781] [2022-07-13 11:16:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:16:08,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:08,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669899781] [2022-07-13 11:16:08,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669899781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:08,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393375997] [2022-07-13 11:16:08,233 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:16:08,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:08,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:08,235 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:08,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 11:16:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:08,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-13 11:16:08,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:08,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:16:08,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:16:08,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:08,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:08,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:08,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:08,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:08,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:08,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:16:08,575 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:08,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 [2022-07-13 11:16:08,668 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:08,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 41 [2022-07-13 11:16:08,741 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:08,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-07-13 11:16:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:16:08,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:11,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (let ((.cse3 (* c_~N~0 5)) (.cse2 (+ .cse0 .cse1 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 5 .cse5))))))))) is different from false [2022-07-13 11:16:13,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_137| Int) (|v_ULTIMATE.start_main_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_137| 4))))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (or (not (= .cse0 5)) (let ((.cse2 (* 5 ~N~0)) (.cse1 (+ .cse0 .cse3 .cse4 .cse5))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= 5 .cse5)) (not (= 5 .cse3))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:16:14,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_137| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_137| 4))))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse0 5)) (let ((.cse2 (* 5 ~N~0)) (.cse1 (+ .cse0 .cse3 .cse4 .cse5))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= 5 .cse5)) (not (= 5 .cse3))))))))) is different from false [2022-07-13 11:16:16,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_137| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_137| 4))))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (or (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse0 5)) (let ((.cse2 (* 5 ~N~0)) (.cse1 (+ .cse0 .cse3 .cse4 .cse5))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 5 .cse5)) (not (= 5 .cse3))))))))) is different from false [2022-07-13 11:16:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2022-07-13 11:16:16,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393375997] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:16,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:16,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 38 [2022-07-13 11:16:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129380519] [2022-07-13 11:16:16,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:16,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 11:16:16,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:16,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 11:16:16,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1008, Unknown=6, NotChecked=268, Total=1406 [2022-07-13 11:16:16,997 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:17,575 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-07-13 11:16:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 11:16:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 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 37 [2022-07-13 11:16:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:17,576 INFO L225 Difference]: With dead ends: 99 [2022-07-13 11:16:17,576 INFO L226 Difference]: Without dead ends: 95 [2022-07-13 11:16:17,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=263, Invalid=1639, Unknown=6, NotChecked=348, Total=2256 [2022-07-13 11:16:17,577 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:17,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 116 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 307 Invalid, 0 Unknown, 439 Unchecked, 0.2s Time] [2022-07-13 11:16:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-13 11:16:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2022-07-13 11:16:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 86 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2022-07-13 11:16:17,590 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 37 [2022-07-13 11:16:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:17,590 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2022-07-13 11:16:17,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-07-13 11:16:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:16:17,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:17,594 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:17,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:17,795 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 [2022-07-13 11:16:17,795 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:17,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2022-07-13 11:16:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:17,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285038442] [2022-07-13 11:16:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:17,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:16:17,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108466884] [2022-07-13 11:16:17,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:16:17,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:17,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:17,810 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:17,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 11:16:17,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:16:17,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:17,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 11:16:17,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:17,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-07-13 11:16:17,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:17,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:16:17,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:17,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:16:18,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:16:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:16:18,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:18,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 5)) is different from false [2022-07-13 11:16:18,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:16:18,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2022-07-13 11:16:18,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:16:18,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-07-13 11:16:18,098 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:16:18,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2022-07-13 11:16:18,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:16:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2022-07-13 11:16:18,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:18,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285038442] [2022-07-13 11:16:18,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:16:18,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108466884] [2022-07-13 11:16:18,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108466884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:18,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:16:18,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-13 11:16:18,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154014502] [2022-07-13 11:16:18,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:18,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 11:16:18,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:18,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 11:16:18,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=310, Unknown=3, NotChecked=114, Total=506 [2022-07-13 11:16:18,168 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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) [2022-07-13 11:16:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:18,442 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2022-07-13 11:16:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:16:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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 37 [2022-07-13 11:16:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:18,443 INFO L225 Difference]: With dead ends: 188 [2022-07-13 11:16:18,444 INFO L226 Difference]: Without dead ends: 181 [2022-07-13 11:16:18,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=404, Unknown=3, NotChecked=132, Total=650 [2022-07-13 11:16:18,444 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 67 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:18,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 108 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 401 Invalid, 0 Unknown, 236 Unchecked, 0.2s Time] [2022-07-13 11:16:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-13 11:16:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 111. [2022-07-13 11:16:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 110 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2022-07-13 11:16:18,454 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 37 [2022-07-13 11:16:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:18,455 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2022-07-13 11:16:18,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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) [2022-07-13 11:16:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2022-07-13 11:16:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:16:18,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:18,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:18,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-13 11:16:18,659 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 [2022-07-13 11:16:18,659 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2022-07-13 11:16:18,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:18,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745151993] [2022-07-13 11:16:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:18,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:18,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:16:18,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043377939] [2022-07-13 11:16:18,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:16:18,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:18,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:18,676 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:18,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 11:16:18,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 11:16:18,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:18,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 11:16:18,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:18,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-07-13 11:16:18,806 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-13 11:16:18,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-13 11:16:18,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:18,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 11:16:18,888 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:16:18,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2022-07-13 11:16:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:16:18,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:19,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_553 (Array Int Int))) (let ((.cse0 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 5) (< .cse0 c_~N~0) (< c_~N~0 .cse0)))) is different from false [2022-07-13 11:16:19,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_166| Int) (v_ArrVal_553 (Array Int Int))) (or (= 5 (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_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_166| 4)))) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_166| 1)) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_166|) |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-07-13 11:16:19,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_166| Int) (v_ArrVal_553 (Array Int Int))) (or (= 5 (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| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_166| 4)))) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_166|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_166| 1) |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-07-13 11:16:19,169 INFO L356 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2022-07-13 11:16:19,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 46 [2022-07-13 11:16:19,176 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-13 11:16:19,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-07-13 11:16:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2022-07-13 11:16:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:19,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745151993] [2022-07-13 11:16:19,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:16:19,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043377939] [2022-07-13 11:16:19,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043377939] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:19,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:16:19,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2022-07-13 11:16:19,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747779537] [2022-07-13 11:16:19,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:19,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 11:16:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 11:16:19,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=338, Unknown=11, NotChecked=120, Total=552 [2022-07-13 11:16:19,201 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:19,808 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= 5 (select (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|))) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_166| Int) (v_ArrVal_553 (Array Int Int))) (or (= 5 (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| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_166| 4)))) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_166|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_166| 1) |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2022-07-13 11:16:21,816 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_166| Int) (v_ArrVal_553 (Array Int Int))) (or (= 5 (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_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_166| 4)))) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_166| 1)) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_166|) |c_ULTIMATE.start_main_~i~0#1|))) (= 5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) is different from false [2022-07-13 11:16:22,417 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (= 5 (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= 5 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_166| Int) (v_ArrVal_553 (Array Int Int))) (or (= 5 (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| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_166| 4)))) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_166|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_166| 1) |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-07-13 11:16:24,440 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_166| Int) (v_ArrVal_553 (Array Int Int))) (or (= 5 (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_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_166| 4)))) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_166| 1)) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_166|) |c_ULTIMATE.start_main_~i~0#1|))) (= 5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (exists ((|v_ULTIMATE.start_main_~i~0#1_158| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_158| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_158| 1)) (= 5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_158| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) is different from false [2022-07-13 11:16:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:26,935 INFO L93 Difference]: Finished difference Result 168 states and 214 transitions. [2022-07-13 11:16:26,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 11:16:26,935 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:16:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:26,936 INFO L225 Difference]: With dead ends: 168 [2022-07-13 11:16:26,936 INFO L226 Difference]: Without dead ends: 164 [2022-07-13 11:16:26,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=158, Invalid=611, Unknown=15, NotChecked=406, Total=1190 [2022-07-13 11:16:26,937 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:26,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 91 Invalid, 0 Unknown, 219 Unchecked, 0.1s Time] [2022-07-13 11:16:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-13 11:16:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2022-07-13 11:16:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.3014705882352942) internal successors, (177), 136 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 177 transitions. [2022-07-13 11:16:26,950 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 177 transitions. Word has length 37 [2022-07-13 11:16:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:26,950 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 177 transitions. [2022-07-13 11:16:26,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 177 transitions. [2022-07-13 11:16:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:16:26,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:26,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:26,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:27,167 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 [2022-07-13 11:16:27,167 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:27,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2022-07-13 11:16:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:27,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077300074] [2022-07-13 11:16:27,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:27,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:16:27,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405198532] [2022-07-13 11:16:27,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:16:27,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:27,178 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:27,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 11:16:27,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:16:27,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:27,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 11:16:27,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:27,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:16:27,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:27,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:16:27,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:27,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:16:27,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 11:16:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:16:27,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:27,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-13 11:16:27,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-13 11:16:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:16:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:27,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077300074] [2022-07-13 11:16:27,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:16:27,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405198532] [2022-07-13 11:16:27,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405198532] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:27,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:16:27,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-13 11:16:27,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459518546] [2022-07-13 11:16:27,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:27,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:16:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:16:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:16:27,419 INFO L87 Difference]: Start difference. First operand 137 states and 177 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:27,648 INFO L93 Difference]: Finished difference Result 222 states and 295 transitions. [2022-07-13 11:16:27,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:16:27,648 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 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 37 [2022-07-13 11:16:27,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:27,649 INFO L225 Difference]: With dead ends: 222 [2022-07-13 11:16:27,649 INFO L226 Difference]: Without dead ends: 151 [2022-07-13 11:16:27,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:16:27,650 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:27,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 84 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:16:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-13 11:16:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2022-07-13 11:16:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 175 transitions. [2022-07-13 11:16:27,663 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 175 transitions. Word has length 37 [2022-07-13 11:16:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:27,663 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 175 transitions. [2022-07-13 11:16:27,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 175 transitions. [2022-07-13 11:16:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:16:27,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:27,664 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:27,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:27,869 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 [2022-07-13 11:16:27,869 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2022-07-13 11:16:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:27,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121329051] [2022-07-13 11:16:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:27,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:16:27,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:27,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121329051] [2022-07-13 11:16:27,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121329051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:27,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200523353] [2022-07-13 11:16:27,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:16:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:27,939 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:27,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 11:16:27,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:16:27,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:27,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:16:27,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:16:28,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:16:28,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200523353] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:28,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:28,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:16:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492229650] [2022-07-13 11:16:28,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:28,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:16:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:28,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:16:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:16:28,115 INFO L87 Difference]: Start difference. First operand 137 states and 175 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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) [2022-07-13 11:16:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:28,459 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-07-13 11:16:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:16:28,460 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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) Word has length 39 [2022-07-13 11:16:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:28,460 INFO L225 Difference]: With dead ends: 182 [2022-07-13 11:16:28,460 INFO L226 Difference]: Without dead ends: 161 [2022-07-13 11:16:28,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:16:28,461 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 70 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:28,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 49 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:16:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-13 11:16:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2022-07-13 11:16:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2022-07-13 11:16:28,472 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2022-07-13 11:16:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:28,472 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2022-07-13 11:16:28,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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) [2022-07-13 11:16:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2022-07-13 11:16:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 11:16:28,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:28,473 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:28,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:28,675 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 [2022-07-13 11:16:28,675 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2022-07-13 11:16:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:28,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570087512] [2022-07-13 11:16:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:16:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:28,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570087512] [2022-07-13 11:16:28,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570087512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:28,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436712293] [2022-07-13 11:16:28,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:16:28,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:28,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:28,740 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:28,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 11:16:28,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 11:16:28,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:28,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:16:28,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:16:28,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:16:28,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436712293] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:28,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:28,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:16:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843969353] [2022-07-13 11:16:28,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:28,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:16:28,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:16:28,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:16:28,941 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:29,095 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-07-13 11:16:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:16:29,096 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-13 11:16:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:29,096 INFO L225 Difference]: With dead ends: 131 [2022-07-13 11:16:29,096 INFO L226 Difference]: Without dead ends: 58 [2022-07-13 11:16:29,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:16:29,097 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 102 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:29,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 28 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:16:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-13 11:16:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-07-13 11:16:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 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) [2022-07-13 11:16:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-13 11:16:29,102 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2022-07-13 11:16:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:29,102 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-13 11:16:29,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-13 11:16:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:16:29,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:29,103 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:29,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:29,307 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 [2022-07-13 11:16:29,307 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2022-07-13 11:16:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:29,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506904789] [2022-07-13 11:16:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:16:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506904789] [2022-07-13 11:16:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506904789] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011217467] [2022-07-13 11:16:29,722 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:16:29,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:29,723 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:29,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 11:16:29,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:16:29,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:29,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 11:16:29,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:29,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:16:29,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:29,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:29,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:29,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:29,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:29,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:29,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:29,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:30,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:30,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:30,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:30,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:30,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:30,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:30,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:30,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:30,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:30,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:16:30,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:30,284 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:30,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 41 [2022-07-13 11:16:30,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:30,405 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:30,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 41 [2022-07-13 11:16:30,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:30,539 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:30,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 43 [2022-07-13 11:16:30,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:30,636 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:30,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 40 [2022-07-13 11:16:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:16:30,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:52,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_237| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_237| 4))))) (or (not (= 5 .cse0)) (not (= .cse1 5)) (not (= 5 .cse2)) (let ((.cse4 (+ .cse1 .cse5 .cse0 .cse6 .cse2)) (.cse3 (* c_~N~0 5))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))) (not (= 5 .cse5)))))))))) is different from false [2022-07-13 11:17:05,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_237| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int) (|v_ULTIMATE.start_main_~i~0#1_249| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_249| 4)))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_237| 4))))) (or (let ((.cse1 (* 5 ~N~0)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 5)) (not (= .cse4 5)) (not (= .cse5 5)) (not (= .cse2 5)))))))))))) is different from false [2022-07-13 11:17:09,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_237| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int) (|v_ULTIMATE.start_main_~i~0#1_249| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_249| 4)))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_237| 4))))) (or (let ((.cse1 (* 5 ~N~0)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 5)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse4 5)) (not (= .cse5 5)) (not (= .cse2 5)))))))))) is different from false [2022-07-13 11:17:17,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_237| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int) (|v_ULTIMATE.start_main_~i~0#1_249| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_249| 4)))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_237| 4))))) (or (let ((.cse1 (* 5 ~N~0)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 5)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse4 5)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= .cse5 5)) (not (= .cse2 5)))))))))) is different from false [2022-07-13 11:17:27,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_237| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int) (|v_ULTIMATE.start_main_~i~0#1_249| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_249| 4)))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_237| 4))))) (or (let ((.cse1 (* 5 ~N~0)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 5)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= .cse4 5)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= .cse5 5)) (not (= .cse2 5)))))))))) is different from false [2022-07-13 11:17:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2022-07-13 11:17:34,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011217467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:17:34,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:17:34,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 53 [2022-07-13 11:17:34,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452266113] [2022-07-13 11:17:34,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:17:34,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 11:17:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:17:34,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 11:17:34,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2082, Unknown=13, NotChecked=480, Total=2756 [2022-07-13 11:17:34,793 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:47,495 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:17:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:17:47,533 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2022-07-13 11:17:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 11:17:47,533 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 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 45 [2022-07-13 11:17:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:17:47,534 INFO L225 Difference]: With dead ends: 133 [2022-07-13 11:17:47,534 INFO L226 Difference]: Without dead ends: 128 [2022-07-13 11:17:47,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=537, Invalid=4437, Unknown=16, NotChecked=710, Total=5700 [2022-07-13 11:17:47,536 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1004 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:17:47,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 191 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 597 Invalid, 0 Unknown, 1004 Unchecked, 0.4s Time] [2022-07-13 11:17:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-13 11:17:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2022-07-13 11:17:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 112 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2022-07-13 11:17:47,550 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 45 [2022-07-13 11:17:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:17:47,550 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2022-07-13 11:17:47,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2022-07-13 11:17:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:17:47,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:17:47,550 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:17:47,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-13 11:17:47,751 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 [2022-07-13 11:17:47,751 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:17:47,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:17:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 4 times [2022-07-13 11:17:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:17:47,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466929569] [2022-07-13 11:17:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:17:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:17:47,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:17:47,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674611754] [2022-07-13 11:17:47,765 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:17:47,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:17:47,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:17:47,766 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:17:47,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 11:17:47,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:17:47,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:17:47,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 11:17:47,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:17:47,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-07-13 11:17:47,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:17:47,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:17:48,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:17:48,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:17:48,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:17:48,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:17:48,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:17:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:17:48,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:17:48,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-13 11:17:48,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2022-07-13 11:17:48,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:17:48,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2022-07-13 11:17:48,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:17:48,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-07-13 11:17:48,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:17:48,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-13 11:17:48,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:17:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2022-07-13 11:17:48,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:17:48,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466929569] [2022-07-13 11:17:48,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:17:48,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674611754] [2022-07-13 11:17:48,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674611754] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:17:48,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:17:48,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-13 11:17:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713262563] [2022-07-13 11:17:48,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:17:48,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 11:17:48,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:17:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 11:17:48,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2022-07-13 11:17:48,260 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:17:48,561 INFO L93 Difference]: Finished difference Result 159 states and 201 transitions. [2022-07-13 11:17:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 11:17:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 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 45 [2022-07-13 11:17:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:17:48,562 INFO L225 Difference]: With dead ends: 159 [2022-07-13 11:17:48,562 INFO L226 Difference]: Without dead ends: 152 [2022-07-13 11:17:48,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=541, Unknown=4, NotChecked=204, Total=870 [2022-07-13 11:17:48,563 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 59 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:17:48,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 292 Invalid, 0 Unknown, 223 Unchecked, 0.2s Time] [2022-07-13 11:17:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-13 11:17:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 143. [2022-07-13 11:17:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.267605633802817) internal successors, (180), 142 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 180 transitions. [2022-07-13 11:17:48,582 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 180 transitions. Word has length 45 [2022-07-13 11:17:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:17:48,582 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 180 transitions. [2022-07-13 11:17:48,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 180 transitions. [2022-07-13 11:17:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:17:48,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:17:48,582 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:17:48,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 11:17:48,783 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 [2022-07-13 11:17:48,783 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:17:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:17:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 5 times [2022-07-13 11:17:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:17:48,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990522952] [2022-07-13 11:17:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:17:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:17:48,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:17:48,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365934609] [2022-07-13 11:17:48,792 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:17:48,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:17:48,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:17:48,793 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:17:48,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 11:17:48,921 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-13 11:17:48,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:17:48,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 11:17:48,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:17:48,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:17:48,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-07-13 11:17:49,009 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:17:49,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:17:49,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:17:49,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:17:49,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:17:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:17:49,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:17:49,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 5)) is different from false [2022-07-13 11:17:49,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2022-07-13 11:17:49,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:17:49,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (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_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2022-07-13 11:17:49,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_286| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_286|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= 5 (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_286| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-07-13 11:17:49,200 INFO L356 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-07-13 11:17:49,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-07-13 11:17:49,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:17:49,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2022-07-13 11:17:49,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:17:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 22 not checked. [2022-07-13 11:17:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:17:49,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990522952] [2022-07-13 11:17:49,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:17:49,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365934609] [2022-07-13 11:17:49,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365934609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:17:49,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:17:49,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-07-13 11:17:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284516788] [2022-07-13 11:17:49,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:17:49,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 11:17:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:17:49,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 11:17:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=5, NotChecked=180, Total=506 [2022-07-13 11:17:49,246 INFO L87 Difference]: Start difference. First operand 143 states and 180 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:51,353 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_286| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_286|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= 5 (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_286| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (= 5 (select (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|)))) is different from false [2022-07-13 11:17:53,377 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_933 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_286| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_286|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= 5 (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_286| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-07-13 11:17:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:17:53,609 INFO L93 Difference]: Finished difference Result 266 states and 348 transitions. [2022-07-13 11:17:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 11:17:53,609 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:17:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:17:53,610 INFO L225 Difference]: With dead ends: 266 [2022-07-13 11:17:53,610 INFO L226 Difference]: Without dead ends: 239 [2022-07-13 11:17:53,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=93, Invalid=348, Unknown=7, NotChecked=308, Total=756 [2022-07-13 11:17:53,611 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:17:53,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 89 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 459 Invalid, 0 Unknown, 276 Unchecked, 0.2s Time] [2022-07-13 11:17:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-13 11:17:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 207. [2022-07-13 11:17:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.2864077669902914) internal successors, (265), 206 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 265 transitions. [2022-07-13 11:17:53,648 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 265 transitions. Word has length 45 [2022-07-13 11:17:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:17:53,649 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 265 transitions. [2022-07-13 11:17:53,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 265 transitions. [2022-07-13 11:17:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:17:53,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:17:53,649 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:17:53,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-13 11:17:53,849 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 [2022-07-13 11:17:53,850 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:17:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:17:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1853695216, now seen corresponding path program 6 times [2022-07-13 11:17:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:17:53,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5085351] [2022-07-13 11:17:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:17:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:17:53,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:17:53,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888238855] [2022-07-13 11:17:53,859 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:17:53,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:17:53,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:17:53,860 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:17:53,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-13 11:17:53,989 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-13 11:17:53,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:17:53,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 11:17:53,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:17:53,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:17:54,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-07-13 11:17:54,069 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:17:54,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-13 11:17:54,096 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:17:54,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-13 11:17:54,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 11:17:54,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-13 11:17:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 11:17:54,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:17:54,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 4)) 1)) is different from false [2022-07-13 11:17:54,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int))) (= (+ (- 4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-07-13 11:17:54,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (+ (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_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 4)) 1)) is different from false [2022-07-13 11:17:54,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_305| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_305|)) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (+ (- 4) (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_305| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)))) is different from false [2022-07-13 11:17:54,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int) (|v_ULTIMATE.start_main_~i~0#1_305| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_305|)) (= (+ (- 4) (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_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_305| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1))) is different from false [2022-07-13 11:17:54,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_306| Int)) (or (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int) (|v_ULTIMATE.start_main_~i~0#1_305| 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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_306| 4)) v_ArrVal_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_305| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 4)) 1) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_306| 1) |v_ULTIMATE.start_main_~i~0#1_305|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_306|)))) is different from false [2022-07-13 11:17:54,326 INFO L356 Elim1Store]: treesize reduction 122, result has 24.2 percent of original size [2022-07-13 11:17:54,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 57 [2022-07-13 11:17:54,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:17:54,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-07-13 11:17:54,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:17:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 22 not checked. [2022-07-13 11:17:54,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:17:54,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5085351] [2022-07-13 11:17:54,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:17:54,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888238855] [2022-07-13 11:17:54,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888238855] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:17:54,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:17:54,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2022-07-13 11:17:54,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200607980] [2022-07-13 11:17:54,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:17:54,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 11:17:54,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:17:54,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 11:17:54,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=222, Unknown=6, NotChecked=210, Total=506 [2022-07-13 11:17:54,368 INFO L87 Difference]: Start difference. First operand 207 states and 265 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:17:56,435 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_306| Int)) (or (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int) (|v_ULTIMATE.start_main_~i~0#1_305| 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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_306| 4)) v_ArrVal_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_305| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 4)) 1) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_306| 1) |v_ULTIMATE.start_main_~i~0#1_305|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_306|)))) (= (+ (- 4) (select (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|))) 1) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-13 11:17:58,461 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 4)) 1) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_305| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_305|)) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (+ (- 4) (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_305| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_306| Int)) (or (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int) (|v_ULTIMATE.start_main_~i~0#1_305| 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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_306| 4)) v_ArrVal_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_305| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 4)) 1) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_306| 1) |v_ULTIMATE.start_main_~i~0#1_305|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_306|))))) is different from false [2022-07-13 11:18:00,489 WARN L833 $PredicateComparison]: unable to prove that (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 4)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_305| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_305|)) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (+ (- 4) (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_305| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)))) (forall ((v_ArrVal_1004 (Array Int Int))) (= (+ (- 4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_306| Int)) (or (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int) (|v_ULTIMATE.start_main_~i~0#1_305| 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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_306| 4)) v_ArrVal_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_305| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 4)) 1) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_306| 1) |v_ULTIMATE.start_main_~i~0#1_305|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_306|))))) is different from false [2022-07-13 11:18:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:00,658 INFO L93 Difference]: Finished difference Result 232 states and 295 transitions. [2022-07-13 11:18:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:18:00,658 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:18:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:00,659 INFO L225 Difference]: With dead ends: 232 [2022-07-13 11:18:00,659 INFO L226 Difference]: Without dead ends: 194 [2022-07-13 11:18:00,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=83, Invalid=250, Unknown=9, NotChecked=360, Total=702 [2022-07-13 11:18:00,659 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:00,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 60 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 341 Invalid, 0 Unknown, 260 Unchecked, 0.2s Time] [2022-07-13 11:18:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-13 11:18:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2022-07-13 11:18:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.2386363636363635) internal successors, (218), 176 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 218 transitions. [2022-07-13 11:18:00,682 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 218 transitions. Word has length 45 [2022-07-13 11:18:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:00,682 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 218 transitions. [2022-07-13 11:18:00,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 218 transitions. [2022-07-13 11:18:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:18:00,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:00,683 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:00,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:00,900 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 [2022-07-13 11:18:00,900 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 3 times [2022-07-13 11:18:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:00,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875691693] [2022-07-13 11:18:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:00,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:00,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:18:00,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383108098] [2022-07-13 11:18:00,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:18:00,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:00,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:00,911 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:00,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-13 11:18:01,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 11:18:01,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:01,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-13 11:18:01,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:01,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:18:01,137 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-13 11:18:01,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-13 11:18:01,192 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-13 11:18:01,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-07-13 11:18:01,271 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-13 11:18:01,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-07-13 11:18:01,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:18:01,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2022-07-13 11:18:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:18:01,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:34,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-07-13 11:18:34,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 198 [2022-07-13 11:18:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 20 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:18:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:34,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875691693] [2022-07-13 11:18:34,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:18:34,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383108098] [2022-07-13 11:18:34,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383108098] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:34,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:18:34,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2022-07-13 11:18:34,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399622077] [2022-07-13 11:18:34,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:34,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 11:18:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 11:18:34,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=987, Unknown=23, NotChecked=0, Total=1332 [2022-07-13 11:18:34,102 INFO L87 Difference]: Start difference. First operand 177 states and 218 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:22,906 INFO L93 Difference]: Finished difference Result 264 states and 320 transitions. [2022-07-13 11:19:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-13 11:19:22,906 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:19:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:22,907 INFO L225 Difference]: With dead ends: 264 [2022-07-13 11:19:22,907 INFO L226 Difference]: Without dead ends: 193 [2022-07-13 11:19:22,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 81.2s TimeCoverageRelationStatistics Valid=814, Invalid=3149, Unknown=69, NotChecked=0, Total=4032 [2022-07-13 11:19:22,909 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:22,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 38 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 197 Invalid, 0 Unknown, 142 Unchecked, 0.1s Time] [2022-07-13 11:19:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-13 11:19:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2022-07-13 11:19:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.2282608695652173) internal successors, (226), 184 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2022-07-13 11:19:22,934 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 45 [2022-07-13 11:19:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:22,935 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2022-07-13 11:19:22,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2022-07-13 11:19:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:19:22,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:22,935 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:22,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-13 11:19:23,135 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 [2022-07-13 11:19:23,136 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:23,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1510143892, now seen corresponding path program 11 times [2022-07-13 11:19:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:23,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604617099] [2022-07-13 11:19:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:23,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:19:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:23,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604617099] [2022-07-13 11:19:23,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604617099] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:23,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253999629] [2022-07-13 11:19:23,244 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:19:23,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:23,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:23,245 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:23,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-13 11:19:23,370 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-13 11:19:23,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:23,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:19:23,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:19:23,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:19:23,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253999629] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:23,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:23,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:19:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968430308] [2022-07-13 11:19:23,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:23,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:19:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:23,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:19:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:19:23,538 INFO L87 Difference]: Start difference. First operand 185 states and 226 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:23,957 INFO L93 Difference]: Finished difference Result 215 states and 262 transitions. [2022-07-13 11:19:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 11:19:23,957 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-13 11:19:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:23,958 INFO L225 Difference]: With dead ends: 215 [2022-07-13 11:19:23,958 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 11:19:23,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:19:23,960 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 91 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:23,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 43 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:19:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 11:19:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 164. [2022-07-13 11:19:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.2453987730061349) internal successors, (203), 163 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 203 transitions. [2022-07-13 11:19:23,984 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 203 transitions. Word has length 47 [2022-07-13 11:19:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:23,984 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 203 transitions. [2022-07-13 11:19:23,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 203 transitions. [2022-07-13 11:19:23,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:19:23,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:23,985 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:24,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-13 11:19:24,202 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 [2022-07-13 11:19:24,202 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash -220752601, now seen corresponding path program 12 times [2022-07-13 11:19:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:24,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622789263] [2022-07-13 11:19:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:19:24,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:24,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622789263] [2022-07-13 11:19:24,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622789263] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:24,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135183843] [2022-07-13 11:19:24,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:19:24,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:24,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:24,297 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:24,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-13 11:19:24,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-13 11:19:24,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:24,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:19:24,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:19:24,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:19:24,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135183843] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:24,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:24,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:19:24,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101187233] [2022-07-13 11:19:24,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:24,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:19:24,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:24,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:19:24,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:19:24,577 INFO L87 Difference]: Start difference. First operand 164 states and 203 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:24,812 INFO L93 Difference]: Finished difference Result 202 states and 246 transitions. [2022-07-13 11:19:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:19:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-13 11:19:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:24,814 INFO L225 Difference]: With dead ends: 202 [2022-07-13 11:19:24,814 INFO L226 Difference]: Without dead ends: 96 [2022-07-13 11:19:24,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:19:24,814 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 110 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:24,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 36 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:19:24,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-13 11:19:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-07-13 11:19:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-13 11:19:24,827 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 48 [2022-07-13 11:19:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:24,827 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-13 11:19:24,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-13 11:19:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:19:24,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:24,828 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:24,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-13 11:19:25,044 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 [2022-07-13 11:19:25,045 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash 663114381, now seen corresponding path program 13 times [2022-07-13 11:19:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:25,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710668519] [2022-07-13 11:19:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:19:25,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:25,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710668519] [2022-07-13 11:19:25,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710668519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:25,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471249281] [2022-07-13 11:19:25,712 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:19:25,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:25,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:25,713 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:25,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 11:19:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:25,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-13 11:19:25,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:25,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:19:25,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:19:25,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:25,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:25,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:25,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:25,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:25,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:25,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:25,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:26,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:26,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:26,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:19:26,203 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:26,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 41 [2022-07-13 11:19:26,349 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:19:26,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 94 treesize of output 63 [2022-07-13 11:19:26,506 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:19:26,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 91 treesize of output 60 [2022-07-13 11:19:26,719 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-13 11:19:26,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 78 [2022-07-13 11:19:26,857 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-13 11:19:26,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 40 [2022-07-13 11:19:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 11:19:26,896 INFO L328 TraceCheckSpWp]: Computing backward predicates...