./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 35987657 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-?-3598765 [2022-07-20 22:16:00,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:16:00,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:16:00,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:16:00,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:16:00,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:16:00,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:16:00,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:16:00,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:16:00,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:16:00,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:16:00,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:16:00,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:16:00,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:16:00,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:16:00,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:16:00,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:16:00,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:16:00,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:16:00,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:16:00,178 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:16:00,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:16:00,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:16:00,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:16:00,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:16:00,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:16:00,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:16:00,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:16:00,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:16:00,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:16:00,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:16:00,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:16:00,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:16:00,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:16:00,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:16:00,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:16:00,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:16:00,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:16:00,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:16:00,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:16:00,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:16:00,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:16:00,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:16:00,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:16:00,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:16:00,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:16:00,235 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:16:00,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:16:00,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:16:00,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:16:00,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:16:00,237 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:16:00,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:16:00,239 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:16:00,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:16:00,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:16:00,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:16:00,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:16:00,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:16:00,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:16:00,240 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:16:00,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:16:00,241 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:16:00,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:16:00,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:16:00,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:16:00,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:16:00,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:16:00,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:16:00,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:16:00,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:16:00,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:16:00,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:16:00,244 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:16:00,244 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:16:00,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:16:00,244 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-20 22:16:00,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:16:00,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:16:00,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:16:00,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:16:00,503 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:16:00,504 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-20 22:16:00,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07101c1e7/f097ff835caf44e3a8294262f6b3c8ea/FLAG64f71336b [2022-07-20 22:16:00,912 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:16:00,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s42if.c [2022-07-20 22:16:00,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07101c1e7/f097ff835caf44e3a8294262f6b3c8ea/FLAG64f71336b [2022-07-20 22:16:00,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07101c1e7/f097ff835caf44e3a8294262f6b3c8ea [2022-07-20 22:16:00,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:16:00,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:16:00,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:16:00,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:16:00,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:16:00,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:16:00" (1/1) ... [2022-07-20 22:16:00,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e9aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:00, skipping insertion in model container [2022-07-20 22:16:00,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:16:00" (1/1) ... [2022-07-20 22:16:00,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:16:00,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:16:01,137 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-20 22:16:01,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:16:01,185 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:16:01,199 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-20 22:16:01,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:16:01,232 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:16:01,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01 WrapperNode [2022-07-20 22:16:01,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:16:01,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:16:01,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:16:01,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:16:01,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,262 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2022-07-20 22:16:01,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:16:01,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:16:01,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:16:01,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:16:01,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:16:01,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:16:01,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:16:01,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:16:01,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (1/1) ... [2022-07-20 22:16:01,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:16:01,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:01,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 22:16:01,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 22:16:01,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:16:01,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:16:01,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 22:16:01,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:16:01,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:16:01,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:16:01,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:16:01,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:16:01,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 22:16:01,407 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:16:01,409 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:16:01,553 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:16:01,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:16:01,558 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 22:16:01,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:16:01 BoogieIcfgContainer [2022-07-20 22:16:01,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:16:01,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:16:01,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:16:01,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:16:01,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:16:00" (1/3) ... [2022-07-20 22:16:01,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcf75b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:16:01, skipping insertion in model container [2022-07-20 22:16:01,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:16:01" (2/3) ... [2022-07-20 22:16:01,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcf75b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:16:01, skipping insertion in model container [2022-07-20 22:16:01,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:16:01" (3/3) ... [2022-07-20 22:16:01,569 INFO L111 eAbstractionObserver]: Analyzing ICFG s42if.c [2022-07-20 22:16:01,581 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:16:01,582 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:16:01,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:16:01,629 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@228536f0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12c3ee27 [2022-07-20 22:16:01,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:16:01,634 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-20 22:16:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 22:16:01,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:01,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:16:01,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:01,645 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2022-07-20 22:16:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:01,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274787087] [2022-07-20 22:16:01,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:01,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:16:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:01,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274787087] [2022-07-20 22:16:01,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274787087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:16:01,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:16:01,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 22:16:01,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777805013] [2022-07-20 22:16:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:16:01,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 22:16:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 22:16:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:16:01,856 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-20 22:16:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:01,873 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-07-20 22:16:01,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 22:16:01,876 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-20 22:16:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:01,882 INFO L225 Difference]: With dead ends: 42 [2022-07-20 22:16:01,882 INFO L226 Difference]: Without dead ends: 19 [2022-07-20 22:16:01,885 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-20 22:16:01,894 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-20 22:16:01,895 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-20 22:16:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-20 22:16:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-20 22:16:01,915 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-20 22:16:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-20 22:16:01,917 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2022-07-20 22:16:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:01,917 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-20 22:16:01,918 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-20 22:16:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-20 22:16:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 22:16:01,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:01,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:16:01,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:16:01,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:01,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2022-07-20 22:16:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:01,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284137622] [2022-07-20 22:16:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:01,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:16:02,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:02,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284137622] [2022-07-20 22:16:02,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284137622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:16:02,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:16:02,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:16:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029509572] [2022-07-20 22:16:02,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:16:02,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:16:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:02,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:16:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:16:02,034 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-20 22:16:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:02,100 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-07-20 22:16:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:16:02,101 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-20 22:16:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:02,101 INFO L225 Difference]: With dead ends: 39 [2022-07-20 22:16:02,101 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 22:16:02,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:16:02,103 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 22:16:02,104 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-20 22:16:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 22:16:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-20 22:16:02,109 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-20 22:16:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-20 22:16:02,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-20 22:16:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:02,117 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-20 22:16:02,118 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-20 22:16:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-20 22:16:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 22:16:02,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:02,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:16:02,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:16:02,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:02,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2022-07-20 22:16:02,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:02,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670366728] [2022-07-20 22:16:02,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:02,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:02,452 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-20 22:16:02,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:02,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670366728] [2022-07-20 22:16:02,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670366728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:02,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119298083] [2022-07-20 22:16:02,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:02,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:02,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:02,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:02,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 22:16:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:02,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 22:16:02,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:02,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:16:02,660 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-20 22:16:02,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:02,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:02,884 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-20 22:16:03,011 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-20 22:16:03,058 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-20 22:16:03,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:03,275 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-20 22:16:03,471 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:16:03,471 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-20 22:16:03,478 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:16:03,478 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-20 22:16:03,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:16:03,483 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-20 22:16:03,490 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-20 22:16:03,499 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-20 22:16:03,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119298083] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:03,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:03,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-07-20 22:16:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60256] [2022-07-20 22:16:03,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:03,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 22:16:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 22:16:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2022-07-20 22:16:03,502 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-20 22:16:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:03,781 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-20 22:16:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 22:16:03,782 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-20 22:16:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:03,783 INFO L225 Difference]: With dead ends: 41 [2022-07-20 22:16:03,783 INFO L226 Difference]: Without dead ends: 37 [2022-07-20 22:16:03,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=418, Unknown=1, NotChecked=44, Total=600 [2022-07-20 22:16:03,785 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-20 22:16:03,786 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-20 22:16:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-20 22:16:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-20 22:16:03,791 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-20 22:16:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-20 22:16:03,792 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-07-20 22:16:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:03,792 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-20 22:16:03,792 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-20 22:16:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-20 22:16:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 22:16:03,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:03,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:16:03,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:04,015 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-20 22:16:04,016 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2022-07-20 22:16:04,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:04,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235699870] [2022-07-20 22:16:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:04,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:04,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:16:04,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849422631] [2022-07-20 22:16:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:04,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:04,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:04,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:04,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 22:16:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:04,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 22:16:04,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:04,162 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-20 22:16:04,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 22:16:04,200 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-20 22:16:04,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:04,240 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-20 22:16:04,244 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:16:04,245 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-20 22:16:04,254 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-20 22:16:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:04,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235699870] [2022-07-20 22:16:04,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:16:04,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849422631] [2022-07-20 22:16:04,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849422631] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:04,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:16:04,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-07-20 22:16:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758111493] [2022-07-20 22:16:04,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:04,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 22:16:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 22:16:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:16:04,258 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-20 22:16:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:04,428 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-07-20 22:16:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 22:16:04,431 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-20 22:16:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:04,433 INFO L225 Difference]: With dead ends: 58 [2022-07-20 22:16:04,433 INFO L226 Difference]: Without dead ends: 51 [2022-07-20 22:16:04,434 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-20 22:16:04,434 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-20 22:16:04,435 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-20 22:16:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-20 22:16:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2022-07-20 22:16:04,443 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-20 22:16:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-07-20 22:16:04,444 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2022-07-20 22:16:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:04,445 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-20 22:16:04,445 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-20 22:16:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-07-20 22:16:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 22:16:04,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:04,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:16:04,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:04,661 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-20 22:16:04,661 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:04,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2022-07-20 22:16:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:04,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034501480] [2022-07-20 22:16:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:04,871 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-20 22:16:04,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:04,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034501480] [2022-07-20 22:16:04,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034501480] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:04,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860970230] [2022-07-20 22:16:04,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:04,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:04,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:04,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:04,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 22:16:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:04,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 22:16:04,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:04,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:16:04,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 22:16:04,991 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-20 22:16:04,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:05,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-20 22:16:05,023 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-20 22:16:05,036 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-20 22:16:05,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860970230] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:05,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:05,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2022-07-20 22:16:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423424201] [2022-07-20 22:16:05,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:05,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:16:05,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:05,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:16:05,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:16:05,039 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-20 22:16:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:05,630 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-07-20 22:16:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 22:16:05,630 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-20 22:16:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:05,631 INFO L225 Difference]: With dead ends: 86 [2022-07-20 22:16:05,631 INFO L226 Difference]: Without dead ends: 72 [2022-07-20 22:16:05,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 22:16:05,633 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 22:16:05,633 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-20 22:16:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-20 22:16:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-07-20 22:16:05,639 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-20 22:16:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-07-20 22:16:05,640 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2022-07-20 22:16:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:05,640 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-07-20 22:16:05,641 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-20 22:16:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-07-20 22:16:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 22:16:05,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:05,641 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-20 22:16:05,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:05,855 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-20 22:16:05,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:05,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2022-07-20 22:16:05,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:05,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452218613] [2022-07-20 22:16:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:05,915 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-20 22:16:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:05,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452218613] [2022-07-20 22:16:05,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452218613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:05,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267444098] [2022-07-20 22:16:05,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:16:05,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:05,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:05,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:05,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 22:16:05,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:16:05,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:05,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:16:05,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:06,026 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-20 22:16:06,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:06,064 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-20 22:16:06,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267444098] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:06,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:06,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 22:16:06,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936187817] [2022-07-20 22:16:06,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:06,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:16:06,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:06,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:16:06,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:16:06,066 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-20 22:16:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:06,221 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-07-20 22:16:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:16:06,221 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-20 22:16:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:06,222 INFO L225 Difference]: With dead ends: 85 [2022-07-20 22:16:06,222 INFO L226 Difference]: Without dead ends: 75 [2022-07-20 22:16:06,222 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-20 22:16:06,223 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-20 22:16:06,223 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-20 22:16:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-20 22:16:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-07-20 22:16:06,230 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-20 22:16:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-07-20 22:16:06,231 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2022-07-20 22:16:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:06,231 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-07-20 22:16:06,232 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-20 22:16:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-07-20 22:16:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 22:16:06,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:06,233 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-20 22:16:06,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:06,433 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-20 22:16:06,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:06,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2022-07-20 22:16:06,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:06,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809423070] [2022-07-20 22:16:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:06,485 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-20 22:16:06,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:06,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809423070] [2022-07-20 22:16:06,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809423070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:06,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743626869] [2022-07-20 22:16:06,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:16:06,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:06,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:06,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:06,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 22:16:06,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 22:16:06,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:06,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:16:06,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:06,617 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-20 22:16:06,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:06,650 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-20 22:16:06,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743626869] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:06,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:06,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 22:16:06,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209228510] [2022-07-20 22:16:06,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:06,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:16:06,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:06,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:16:06,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:16:06,652 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-20 22:16:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:06,758 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-07-20 22:16:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:16:06,759 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-20 22:16:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:06,759 INFO L225 Difference]: With dead ends: 78 [2022-07-20 22:16:06,759 INFO L226 Difference]: Without dead ends: 42 [2022-07-20 22:16:06,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-20 22:16:06,760 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 22:16:06,761 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-20 22:16:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-20 22:16:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-07-20 22:16:06,765 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-20 22:16:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-20 22:16:06,765 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2022-07-20 22:16:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:06,765 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-20 22:16:06,766 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-20 22:16:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-20 22:16:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 22:16:06,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:06,766 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-20 22:16:06,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:06,986 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-20 22:16:06,987 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:06,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2022-07-20 22:16:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:06,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129265151] [2022-07-20 22:16:06,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:07,348 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-20 22:16:07,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:07,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129265151] [2022-07-20 22:16:07,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129265151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:07,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550197590] [2022-07-20 22:16:07,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:16:07,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:07,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:07,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:07,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 22:16:07,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:16:07,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:07,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 22:16:07,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:07,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:16:07,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:07,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:07,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:07,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:07,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:07,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:07,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:07,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:07,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:07,682 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-20 22:16:07,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:07,782 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:16:07,782 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-20 22:16:07,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:07,881 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:16:07,881 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-20 22:16:07,915 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-20 22:16:07,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:08,653 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-20 22:16:09,517 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-20 22:16:09,818 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-20 22:16:10,182 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-20 22:16:10,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550197590] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:10,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:10,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2022-07-20 22:16:10,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075737753] [2022-07-20 22:16:10,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:10,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 22:16:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 22:16:10,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056 [2022-07-20 22:16:10,187 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-20 22:16:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:10,954 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-07-20 22:16:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 22:16:10,955 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-20 22:16:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:10,955 INFO L225 Difference]: With dead ends: 83 [2022-07-20 22:16:10,956 INFO L226 Difference]: Without dead ends: 78 [2022-07-20 22:16:10,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=274, Invalid=1457, Unknown=3, NotChecked=246, Total=1980 [2022-07-20 22:16:10,958 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:16:10,958 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.3s Time] [2022-07-20 22:16:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-20 22:16:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2022-07-20 22:16:10,966 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-20 22:16:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-07-20 22:16:10,967 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 29 [2022-07-20 22:16:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:10,967 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-07-20 22:16:10,967 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-20 22:16:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-07-20 22:16:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 22:16:10,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:10,968 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-20 22:16:10,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-20 22:16:11,191 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-20 22:16:11,191 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2022-07-20 22:16:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:11,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922484110] [2022-07-20 22:16:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:11,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:16:11,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381477321] [2022-07-20 22:16:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:11,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:11,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:11,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 22:16:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:11,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 22:16:11,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:11,337 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-20 22:16:11,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:11,389 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-20 22:16:11,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 22:16:11,416 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-20 22:16:11,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:11,454 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-20 22:16:11,463 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-20 22:16:11,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:16:11,505 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-20 22:16:11,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:16:11,511 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-20 22:16:11,514 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-20 22:16:11,568 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-20 22:16:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:11,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922484110] [2022-07-20 22:16:11,568 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:16:11,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381477321] [2022-07-20 22:16:11,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381477321] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:11,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:16:11,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-20 22:16:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339852766] [2022-07-20 22:16:11,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:11,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 22:16:11,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:11,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 22:16:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2022-07-20 22:16:11,570 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-20 22:16:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:11,784 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2022-07-20 22:16:11,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:16:11,785 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-20 22:16:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:11,785 INFO L225 Difference]: With dead ends: 109 [2022-07-20 22:16:11,785 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 22:16:11,786 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-20 22:16:11,786 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-20 22:16:11,786 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-20 22:16:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 22:16:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2022-07-20 22:16:11,796 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-20 22:16:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-07-20 22:16:11,797 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 29 [2022-07-20 22:16:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:11,797 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-07-20 22:16:11,797 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-20 22:16:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-07-20 22:16:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 22:16:11,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:11,798 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-20 22:16:11,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-20 22:16:12,011 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-20 22:16:12,012 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:12,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2022-07-20 22:16:12,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:12,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882568935] [2022-07-20 22:16:12,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:12,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:12,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:16:12,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254642317] [2022-07-20 22:16:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:12,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:12,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:12,028 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:12,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 22:16:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:12,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 22:16:12,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:12,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 22:16:12,134 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 22:16:12,134 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-20 22:16:12,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 22:16:12,153 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-20 22:16:12,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:12,180 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-20 22:16:12,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-20 22:16:12,189 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-20 22:16:12,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882568935] [2022-07-20 22:16:12,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:16:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254642317] [2022-07-20 22:16:12,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254642317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:12,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:16:12,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-20 22:16:12,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295804370] [2022-07-20 22:16:12,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:12,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 22:16:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 22:16:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-20 22:16:12,191 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-20 22:16:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:12,299 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2022-07-20 22:16:12,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 22:16:12,299 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-20 22:16:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:12,300 INFO L225 Difference]: With dead ends: 123 [2022-07-20 22:16:12,300 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 22:16:12,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-20 22:16:12,301 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-20 22:16:12,302 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-20 22:16:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 22:16:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2022-07-20 22:16:12,311 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-20 22:16:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2022-07-20 22:16:12,312 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 29 [2022-07-20 22:16:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:12,312 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2022-07-20 22:16:12,312 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-20 22:16:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2022-07-20 22:16:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 22:16:12,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:12,314 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-20 22:16:12,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-20 22:16:12,527 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-20 22:16:12,528 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:12,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2022-07-20 22:16:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:12,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441460673] [2022-07-20 22:16:12,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:12,585 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-20 22:16:12,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:12,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441460673] [2022-07-20 22:16:12,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441460673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:12,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660207073] [2022-07-20 22:16:12,585 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:16:12,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:12,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:12,586 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:12,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 22:16:12,646 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-20 22:16:12,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:12,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:16:12,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:12,721 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-20 22:16:12,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:12,752 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-20 22:16:12,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660207073] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:12,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:12,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 22:16:12,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574964525] [2022-07-20 22:16:12,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:12,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:16:12,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:12,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:16:12,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:16:12,754 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-20 22:16:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:12,973 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2022-07-20 22:16:12,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 22:16:12,974 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-20 22:16:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:12,974 INFO L225 Difference]: With dead ends: 110 [2022-07-20 22:16:12,974 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 22:16:12,975 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-20 22:16:12,976 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:16:12,976 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.2s Time] [2022-07-20 22:16:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 22:16:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2022-07-20 22:16:12,984 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-20 22:16:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2022-07-20 22:16:12,985 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 31 [2022-07-20 22:16:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:12,985 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2022-07-20 22:16:12,985 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-20 22:16:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-07-20 22:16:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 22:16:12,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:12,986 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-20 22:16:13,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-20 22:16:13,211 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-20 22:16:13,211 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:13,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2022-07-20 22:16:13,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:13,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065687783] [2022-07-20 22:16:13,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:13,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:13,270 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-20 22:16:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:13,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065687783] [2022-07-20 22:16:13,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065687783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:13,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561166765] [2022-07-20 22:16:13,271 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:16:13,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:13,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:13,272 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:13,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 22:16:13,339 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-20 22:16:13,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:13,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:16:13,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:13,411 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-20 22:16:13,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:13,451 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-20 22:16:13,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561166765] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:13,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:13,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 22:16:13,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931170081] [2022-07-20 22:16:13,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:13,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:16:13,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:13,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:16:13,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:16:13,453 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-20 22:16:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:13,586 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-07-20 22:16:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:16:13,586 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-20 22:16:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:13,587 INFO L225 Difference]: With dead ends: 101 [2022-07-20 22:16:13,587 INFO L226 Difference]: Without dead ends: 50 [2022-07-20 22:16:13,587 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-20 22:16:13,588 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-20 22:16:13,588 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-20 22:16:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-20 22:16:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-07-20 22:16:13,592 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-20 22:16:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-20 22:16:13,593 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2022-07-20 22:16:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:13,593 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-20 22:16:13,593 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-20 22:16:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-20 22:16:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:16:13,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:13,594 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-20 22:16:13,622 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-20 22:16:13,803 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-20 22:16:13,803 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2022-07-20 22:16:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:13,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226490961] [2022-07-20 22:16:13,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:14,250 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-20 22:16:14,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226490961] [2022-07-20 22:16:14,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226490961] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882809968] [2022-07-20 22:16:14,251 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 22:16:14,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:14,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:14,256 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:14,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 22:16:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:14,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-20 22:16:14,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:14,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:16:14,338 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-20 22:16:14,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:14,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:14,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:14,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:14,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:14,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:14,544 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-20 22:16:14,637 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:16:14,637 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-20 22:16:14,749 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:16:14,749 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-20 22:16:14,848 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:16:14,848 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-20 22:16:14,876 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-20 22:16:14,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:17,529 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-20 22:16:20,329 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-20 22:16:21,313 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-20 22:16:23,299 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-20 22:16:24,334 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-20 22:16:24,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882809968] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:24,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:24,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 38 [2022-07-20 22:16:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034522168] [2022-07-20 22:16:24,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:24,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 22:16:24,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 22:16:24,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1008, Unknown=6, NotChecked=268, Total=1406 [2022-07-20 22:16:24,336 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-20 22:16:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:25,009 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-07-20 22:16:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 22:16:25,009 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-20 22:16:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:25,010 INFO L225 Difference]: With dead ends: 99 [2022-07-20 22:16:25,010 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 22:16:25,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=263, Invalid=1639, Unknown=6, NotChecked=348, Total=2256 [2022-07-20 22:16:25,012 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-20 22:16:25,012 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-20 22:16:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 22:16:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2022-07-20 22:16:25,022 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-20 22:16:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2022-07-20 22:16:25,023 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 37 [2022-07-20 22:16:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:25,023 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2022-07-20 22:16:25,024 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-20 22:16:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-07-20 22:16:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:16:25,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:25,025 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-20 22:16:25,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:25,247 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-20 22:16:25,248 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2022-07-20 22:16:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:25,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620790338] [2022-07-20 22:16:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:25,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:25,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:16:25,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214110940] [2022-07-20 22:16:25,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:16:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:25,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:25,264 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:25,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 22:16:25,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:16:25,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:25,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 22:16:25,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:25,420 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-20 22:16:25,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:25,460 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-20 22:16:25,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:25,485 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-20 22:16:25,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 22:16:25,516 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-20 22:16:25,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:25,542 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-20 22:16:25,548 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-20 22:16:25,555 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-20 22:16:25,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:16:25,587 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-20 22:16:25,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:16:25,593 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-20 22:16:25,596 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-20 22:16:25,672 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-20 22:16:25,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:25,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620790338] [2022-07-20 22:16:25,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:16:25,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214110940] [2022-07-20 22:16:25,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214110940] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:25,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:16:25,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-20 22:16:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756810195] [2022-07-20 22:16:25,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:25,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 22:16:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:25,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 22:16:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=310, Unknown=3, NotChecked=114, Total=506 [2022-07-20 22:16:25,675 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-20 22:16:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:26,033 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2022-07-20 22:16:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 22:16:26,034 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-20 22:16:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:26,035 INFO L225 Difference]: With dead ends: 188 [2022-07-20 22:16:26,035 INFO L226 Difference]: Without dead ends: 181 [2022-07-20 22:16:26,035 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-20 22:16:26,036 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 67 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 22:16:26,036 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-20 22:16:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-20 22:16:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 111. [2022-07-20 22:16:26,047 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-20 22:16:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2022-07-20 22:16:26,047 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 37 [2022-07-20 22:16:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:26,048 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2022-07-20 22:16:26,048 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-20 22:16:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2022-07-20 22:16:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:16:26,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:26,048 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-20 22:16:26,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:26,251 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-20 22:16:26,251 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2022-07-20 22:16:26,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:26,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735201494] [2022-07-20 22:16:26,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:26,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:16:26,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254880017] [2022-07-20 22:16:26,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:16:26,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:26,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:26,268 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:26,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 22:16:26,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 22:16:26,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:26,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 22:16:26,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:26,382 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-20 22:16:26,425 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-20 22:16:26,425 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-20 22:16:26,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:26,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-20 22:16:26,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:16:26,538 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-20 22:16:26,625 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-20 22:16:26,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:26,688 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-20 22:16:26,811 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-20 22:16:26,821 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-20 22:16:26,887 INFO L356 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2022-07-20 22:16:26,888 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-20 22:16:26,897 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-20 22:16:26,897 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-20 22:16:26,920 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-20 22:16:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:26,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735201494] [2022-07-20 22:16:26,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:16:26,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254880017] [2022-07-20 22:16:26,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254880017] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:26,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:16:26,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2022-07-20 22:16:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582851946] [2022-07-20 22:16:26,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:26,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 22:16:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:26,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 22:16:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=338, Unknown=11, NotChecked=120, Total=552 [2022-07-20 22:16:26,923 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-20 22:16:27,558 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-20 22:16:29,566 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-20 22:16:30,179 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-20 22:16:32,189 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-20 22:16:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:36,335 INFO L93 Difference]: Finished difference Result 168 states and 214 transitions. [2022-07-20 22:16:36,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 22:16:36,336 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-20 22:16:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:36,337 INFO L225 Difference]: With dead ends: 168 [2022-07-20 22:16:36,337 INFO L226 Difference]: Without dead ends: 164 [2022-07-20 22:16:36,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=158, Invalid=611, Unknown=15, NotChecked=406, Total=1190 [2022-07-20 22:16:36,339 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-20 22:16:36,339 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-20 22:16:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-20 22:16:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2022-07-20 22:16:36,357 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-20 22:16:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 177 transitions. [2022-07-20 22:16:36,357 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 177 transitions. Word has length 37 [2022-07-20 22:16:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:36,358 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 177 transitions. [2022-07-20 22:16:36,358 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-20 22:16:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 177 transitions. [2022-07-20 22:16:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:16:36,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:36,358 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-20 22:16:36,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:36,559 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-20 22:16:36,559 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2022-07-20 22:16:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:36,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047333864] [2022-07-20 22:16:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:36,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:16:36,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [515572829] [2022-07-20 22:16:36,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:16:36,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:36,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:36,576 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:36,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 22:16:36,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:16:36,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:36,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 22:16:36,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:36,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 22:16:36,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:36,712 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-20 22:16:36,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:36,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, 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-20 22:16:36,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 22:16:36,771 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-20 22:16:36,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:36,818 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-20 22:16:36,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-20 22:16:36,851 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-20 22:16:36,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:36,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047333864] [2022-07-20 22:16:36,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:16:36,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515572829] [2022-07-20 22:16:36,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515572829] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:36,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:16:36,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-20 22:16:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136665906] [2022-07-20 22:16:36,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:36,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:16:36,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:36,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:16:36,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:16:36,855 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-20 22:16:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:37,137 INFO L93 Difference]: Finished difference Result 222 states and 295 transitions. [2022-07-20 22:16:37,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 22:16:37,137 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-20 22:16:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:37,138 INFO L225 Difference]: With dead ends: 222 [2022-07-20 22:16:37,138 INFO L226 Difference]: Without dead ends: 151 [2022-07-20 22:16:37,139 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-20 22:16:37,139 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 22:16:37,139 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-20 22:16:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-20 22:16:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2022-07-20 22:16:37,160 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-20 22:16:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 175 transitions. [2022-07-20 22:16:37,161 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 175 transitions. Word has length 37 [2022-07-20 22:16:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:37,161 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 175 transitions. [2022-07-20 22:16:37,161 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-20 22:16:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 175 transitions. [2022-07-20 22:16:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:16:37,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:37,163 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-20 22:16:37,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:37,386 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-20 22:16:37,387 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:37,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:37,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2022-07-20 22:16:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:37,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719706509] [2022-07-20 22:16:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:37,478 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-20 22:16:37,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:37,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719706509] [2022-07-20 22:16:37,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719706509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:37,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317117991] [2022-07-20 22:16:37,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:16:37,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:37,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:37,480 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:37,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 22:16:37,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:16:37,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:37,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:16:37,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:37,620 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-20 22:16:37,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:37,663 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-20 22:16:37,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317117991] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:37,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:37,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-20 22:16:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381620327] [2022-07-20 22:16:37,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:37,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:16:37,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:37,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:16:37,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:16:37,666 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-20 22:16:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:38,023 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-07-20 22:16:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:16:38,023 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-20 22:16:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:38,024 INFO L225 Difference]: With dead ends: 182 [2022-07-20 22:16:38,024 INFO L226 Difference]: Without dead ends: 161 [2022-07-20 22:16:38,024 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-20 22:16:38,025 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-20 22:16:38,025 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-20 22:16:38,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-20 22:16:38,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2022-07-20 22:16:38,039 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-20 22:16:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2022-07-20 22:16:38,040 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2022-07-20 22:16:38,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:38,040 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2022-07-20 22:16:38,041 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-20 22:16:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2022-07-20 22:16:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 22:16:38,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:38,041 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-20 22:16:38,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-20 22:16:38,255 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-20 22:16:38,255 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:38,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2022-07-20 22:16:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:38,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845416024] [2022-07-20 22:16:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:38,330 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-20 22:16:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:38,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845416024] [2022-07-20 22:16:38,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845416024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:38,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837782173] [2022-07-20 22:16:38,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:16:38,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:38,332 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:38,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 22:16:38,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-20 22:16:38,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:38,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:16:38,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:38,506 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-20 22:16:38,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:16:38,548 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-20 22:16:38,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837782173] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:16:38,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:16:38,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-20 22:16:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898908130] [2022-07-20 22:16:38,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:16:38,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:16:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:16:38,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:16:38,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:16:38,550 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-20 22:16:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:16:38,748 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-07-20 22:16:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 22:16:38,749 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-20 22:16:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:16:38,750 INFO L225 Difference]: With dead ends: 131 [2022-07-20 22:16:38,750 INFO L226 Difference]: Without dead ends: 58 [2022-07-20 22:16:38,750 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-20 22:16:38,751 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:16:38,751 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.2s Time] [2022-07-20 22:16:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-20 22:16:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-07-20 22:16:38,756 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-20 22:16:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-20 22:16:38,757 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2022-07-20 22:16:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:16:38,757 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-20 22:16:38,757 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-20 22:16:38,758 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-20 22:16:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 22:16:38,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:16:38,758 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-20 22:16:38,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 22:16:38,982 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-20 22:16:38,982 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:16:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:16:38,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2022-07-20 22:16:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:16:38,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506584522] [2022-07-20 22:16:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:16:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:16:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:16:39,460 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-20 22:16:39,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:16:39,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506584522] [2022-07-20 22:16:39,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506584522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:16:39,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645791378] [2022-07-20 22:16:39,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:16:39,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:16:39,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:16:39,463 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:16:39,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 22:16:39,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:16:39,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:16:39,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 22:16:39,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:16:39,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:16:39,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:39,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:39,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:39,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:39,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:39,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:39,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:39,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:39,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:39,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:39,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:39,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:39,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:39,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:39,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:39,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:16:39,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:39,967 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-20 22:16:40,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:40,072 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:16:40,073 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-20 22:16:40,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:40,225 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:16:40,225 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-20 22:16:40,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:40,360 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:16:40,360 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-20 22:16:40,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:16:40,452 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:16:40,452 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-20 22:16:40,495 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-20 22:16:40,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:17:02,812 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-20 22:17:17,054 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-20 22:17:20,440 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-20 22:17:29,885 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-20 22:17:40,730 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-20 22:17:46,179 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-20 22:17:46,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645791378] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:17:46,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:17:46,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 53 [2022-07-20 22:17:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100266470] [2022-07-20 22:17:46,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:17:46,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-20 22:17:46,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:17:46,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-20 22:17:46,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2080, Unknown=15, NotChecked=480, Total=2756 [2022-07-20 22:17:46,181 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-20 22:17:57,127 WARN L233 SmtUtils]: Spent 5.45s 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-20 22:17:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:17:57,164 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-07-20 22:17:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-20 22:17:57,165 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-20 22:17:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:17:57,166 INFO L225 Difference]: With dead ends: 136 [2022-07-20 22:17:57,166 INFO L226 Difference]: Without dead ends: 131 [2022-07-20 22:17:57,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=538, Invalid=4436, Unknown=16, NotChecked=710, Total=5700 [2022-07-20 22:17:57,168 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 72 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1075 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:17:57,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 191 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 710 Invalid, 0 Unknown, 1075 Unchecked, 0.5s Time] [2022-07-20 22:17:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-20 22:17:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2022-07-20 22:17:57,192 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-20 22:17:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2022-07-20 22:17:57,192 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 45 [2022-07-20 22:17:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:17:57,193 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2022-07-20 22:17:57,193 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-20 22:17:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2022-07-20 22:17:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 22:17:57,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:17:57,194 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-20 22:17:57,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-20 22:17:57,399 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-20 22:17:57,400 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:17:57,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:17:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 4 times [2022-07-20 22:17:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:17:57,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161639918] [2022-07-20 22:17:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:17:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:17:57,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:17:57,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173054468] [2022-07-20 22:17:57,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:17:57,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:17:57,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:17:57,413 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:17:57,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 22:17:57,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:17:57,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:17:57,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 22:17:57,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:17:57,617 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-20 22:17:57,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:17:57,663 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-20 22:17:57,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:17:57,694 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-20 22:17:57,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:17:57,725 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-20 22:17:57,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 22:17:57,766 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-20 22:17:57,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:17:57,798 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-20 22:17:57,803 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-20 22:17:57,812 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-20 22:17:57,821 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-20 22:17:57,855 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:17:57,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 22:17:57,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:17:57,860 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-20 22:17:57,866 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-20 22:17:57,965 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-20 22:17:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:17:57,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161639918] [2022-07-20 22:17:57,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:17:57,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173054468] [2022-07-20 22:17:57,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173054468] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:17:57,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:17:57,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-20 22:17:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187498252] [2022-07-20 22:17:57,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:17:57,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 22:17:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:17:57,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 22:17:57,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2022-07-20 22:17:57,967 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-20 22:17:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:17:58,484 INFO L93 Difference]: Finished difference Result 238 states and 308 transitions. [2022-07-20 22:17:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:17:58,484 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-20 22:17:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:17:58,485 INFO L225 Difference]: With dead ends: 238 [2022-07-20 22:17:58,485 INFO L226 Difference]: Without dead ends: 231 [2022-07-20 22:17:58,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=533, Unknown=4, NotChecked=204, Total=870 [2022-07-20 22:17:58,486 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 119 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:17:58,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 96 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 486 Invalid, 0 Unknown, 314 Unchecked, 0.3s Time] [2022-07-20 22:17:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-20 22:17:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 143. [2022-07-20 22:17:58,509 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-20 22:17:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 180 transitions. [2022-07-20 22:17:58,510 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 180 transitions. Word has length 45 [2022-07-20 22:17:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:17:58,510 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 180 transitions. [2022-07-20 22:17:58,510 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-20 22:17:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 180 transitions. [2022-07-20 22:17:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 22:17:58,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:17:58,511 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-20 22:17:58,528 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-20 22:17:58,711 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-20 22:17:58,711 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:17:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:17:58,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 5 times [2022-07-20 22:17:58,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:17:58,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152668877] [2022-07-20 22:17:58,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:17:58,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:17:58,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:17:58,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519143701] [2022-07-20 22:17:58,724 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:17:58,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:17:58,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:17:58,725 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:17:58,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 22:17:58,851 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-20 22:17:58,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:17:58,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 22:17:58,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:17:58,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:17:58,914 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-20 22:17:58,953 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 22:17:58,953 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-20 22:17:58,996 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-20 22:17:59,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 16 treesize of output 18 [2022-07-20 22:17:59,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 22:17:59,048 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-20 22:17:59,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:17:59,074 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-20 22:17:59,079 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-20 22:17:59,086 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-20 22:17:59,094 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-20 22:17:59,107 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-20 22:17:59,186 INFO L356 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-07-20 22:17:59,186 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-20 22:17:59,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:17:59,192 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-20 22:17:59,195 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-20 22:17:59,234 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-20 22:17:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:17:59,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152668877] [2022-07-20 22:17:59,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:17:59,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519143701] [2022-07-20 22:17:59,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519143701] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:17:59,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:17:59,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-07-20 22:17:59,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647471075] [2022-07-20 22:17:59,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:17:59,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 22:17:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:17:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 22:17:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=5, NotChecked=180, Total=506 [2022-07-20 22:17:59,236 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-20 22:18:01,346 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-20 22:18:03,369 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-20 22:18:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:03,573 INFO L93 Difference]: Finished difference Result 247 states and 323 transitions. [2022-07-20 22:18:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 22:18:03,573 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-20 22:18:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:03,574 INFO L225 Difference]: With dead ends: 247 [2022-07-20 22:18:03,574 INFO L226 Difference]: Without dead ends: 220 [2022-07-20 22:18:03,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=93, Invalid=348, Unknown=7, NotChecked=308, Total=756 [2022-07-20 22:18:03,575 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:03,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 347 Invalid, 0 Unknown, 238 Unchecked, 0.2s Time] [2022-07-20 22:18:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-20 22:18:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 207. [2022-07-20 22:18:03,619 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-20 22:18:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 265 transitions. [2022-07-20 22:18:03,619 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 265 transitions. Word has length 45 [2022-07-20 22:18:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:03,619 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 265 transitions. [2022-07-20 22:18:03,620 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-20 22:18:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 265 transitions. [2022-07-20 22:18:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 22:18:03,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:03,620 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-20 22:18:03,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-20 22:18:03,820 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-20 22:18:03,821 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1853695216, now seen corresponding path program 6 times [2022-07-20 22:18:03,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:03,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6426349] [2022-07-20 22:18:03,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:03,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:03,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:18:03,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805080091] [2022-07-20 22:18:03,831 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:18:03,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:03,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:03,833 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:18:03,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-20 22:18:03,983 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-20 22:18:03,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:03,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 22:18:03,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:03,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:18:04,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-20 22:18:04,070 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 22:18:04,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-20 22:18:04,098 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 22:18:04,098 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-20 22:18:04,134 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-20 22:18:04,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 22:18:04,163 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-20 22:18:04,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:04,194 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-20 22:18:04,199 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-20 22:18:04,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-20 22:18:04,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-20 22:18:04,234 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-20 22:18:04,251 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-20 22:18:04,321 INFO L356 Elim1Store]: treesize reduction 122, result has 24.2 percent of original size [2022-07-20 22:18:04,321 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-20 22:18:04,327 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:18:04,328 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-20 22:18:04,330 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-20 22:18:04,359 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-20 22:18:04,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:04,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6426349] [2022-07-20 22:18:04,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:18:04,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805080091] [2022-07-20 22:18:04,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805080091] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:04,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:18:04,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2022-07-20 22:18:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996144737] [2022-07-20 22:18:04,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:04,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 22:18:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:04,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 22:18:04,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=222, Unknown=6, NotChecked=210, Total=506 [2022-07-20 22:18:04,360 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-20 22:18:06,417 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-20 22:18:08,444 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-20 22:18:10,480 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_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-20 22:18:10,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:10,640 INFO L93 Difference]: Finished difference Result 238 states and 301 transitions. [2022-07-20 22:18:10,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 22:18:10,640 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-20 22:18:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:10,641 INFO L225 Difference]: With dead ends: 238 [2022-07-20 22:18:10,641 INFO L226 Difference]: Without dead ends: 194 [2022-07-20 22:18:10,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=83, Invalid=250, Unknown=9, NotChecked=360, Total=702 [2022-07-20 22:18:10,644 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:10,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 66 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 290 Invalid, 0 Unknown, 250 Unchecked, 0.2s Time] [2022-07-20 22:18:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-20 22:18:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2022-07-20 22:18:10,668 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-20 22:18:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 218 transitions. [2022-07-20 22:18:10,669 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 218 transitions. Word has length 45 [2022-07-20 22:18:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:10,669 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 218 transitions. [2022-07-20 22:18:10,669 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-20 22:18:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 218 transitions. [2022-07-20 22:18:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 22:18:10,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:10,670 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-20 22:18:10,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-20 22:18:10,870 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-20 22:18:10,871 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 3 times [2022-07-20 22:18:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:10,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36386590] [2022-07-20 22:18:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:10,885 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:18:10,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265061344] [2022-07-20 22:18:10,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:18:10,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:10,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:10,887 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:18:10,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-20 22:18:11,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-20 22:18:11,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:11,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 22:18:11,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:11,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 22:18:11,133 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-20 22:18:11,133 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-20 22:18:11,186 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-20 22:18:11,186 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-20 22:18:11,270 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-20 22:18:11,270 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-20 22:18:11,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:18:11,387 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-20 22:18:11,626 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-20 22:18:11,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:35,584 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-20 22:18:35,589 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-20 22:18:35,628 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-20 22:18:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36386590] [2022-07-20 22:18:35,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:18:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265061344] [2022-07-20 22:18:35,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265061344] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:35,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:18:35,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2022-07-20 22:18:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007118237] [2022-07-20 22:18:35,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:35,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 22:18:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:35,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 22:18:35,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=938, Unknown=17, NotChecked=0, Total=1260 [2022-07-20 22:18:35,631 INFO L87 Difference]: Start difference. First operand 177 states and 218 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:19:01,845 INFO L93 Difference]: Finished difference Result 260 states and 316 transitions. [2022-07-20 22:19:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-20 22:19:01,845 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 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-20 22:19:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:19:01,846 INFO L225 Difference]: With dead ends: 260 [2022-07-20 22:19:01,846 INFO L226 Difference]: Without dead ends: 189 [2022-07-20 22:19:01,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=797, Invalid=2697, Unknown=46, NotChecked=0, Total=3540 [2022-07-20 22:19:01,848 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:19:01,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 55 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 253 Invalid, 0 Unknown, 233 Unchecked, 0.2s Time] [2022-07-20 22:19:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-20 22:19:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2022-07-20 22:19:01,880 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-20 22:19:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2022-07-20 22:19:01,880 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 45 [2022-07-20 22:19:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:19:01,881 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2022-07-20 22:19:01,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2022-07-20 22:19:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 22:19:01,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:19:01,882 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-20 22:19:01,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-20 22:19:02,087 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-20 22:19:02,087 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:19:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:19:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1510143892, now seen corresponding path program 11 times [2022-07-20 22:19:02,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:19:02,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275532653] [2022-07-20 22:19:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:02,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:19:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:02,220 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-20 22:19:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:19:02,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275532653] [2022-07-20 22:19:02,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275532653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:19:02,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494445978] [2022-07-20 22:19:02,220 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:19:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:19:02,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:19:02,222 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:19:02,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-20 22:19:02,358 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-20 22:19:02,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:19:02,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 22:19:02,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:19:02,474 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-20 22:19:02,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:19:02,542 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-20 22:19:02,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494445978] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:19:02,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:19:02,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-20 22:19:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560034422] [2022-07-20 22:19:02,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:19:02,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 22:19:02,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:19:02,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 22:19:02,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-20 22:19:02,544 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-20 22:19:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:19:02,987 INFO L93 Difference]: Finished difference Result 215 states and 262 transitions. [2022-07-20 22:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 22:19:02,988 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-20 22:19:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:19:02,989 INFO L225 Difference]: With dead ends: 215 [2022-07-20 22:19:02,989 INFO L226 Difference]: Without dead ends: 196 [2022-07-20 22:19:02,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-20 22:19:02,989 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 107 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:19:02,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 22:19:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-20 22:19:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 164. [2022-07-20 22:19:03,013 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-20 22:19:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 203 transitions. [2022-07-20 22:19:03,014 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 203 transitions. Word has length 47 [2022-07-20 22:19:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:19:03,014 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 203 transitions. [2022-07-20 22:19:03,015 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-20 22:19:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 203 transitions. [2022-07-20 22:19:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 22:19:03,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:19:03,015 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-20 22:19:03,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-20 22:19:03,228 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-20 22:19:03,228 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:19:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:19:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash -220752601, now seen corresponding path program 12 times [2022-07-20 22:19:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:19:03,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582984064] [2022-07-20 22:19:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:03,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:19:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:03,359 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-20 22:19:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:19:03,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582984064] [2022-07-20 22:19:03,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582984064] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:19:03,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874034306] [2022-07-20 22:19:03,360 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:19:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:19:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:19:03,364 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:19:03,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-20 22:19:03,488 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-20 22:19:03,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:19:03,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 22:19:03,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:19:03,599 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-20 22:19:03,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:19:03,657 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-20 22:19:03,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874034306] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:19:03,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:19:03,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-20 22:19:03,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474479163] [2022-07-20 22:19:03,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:19:03,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 22:19:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:19:03,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 22:19:03,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-20 22:19:03,659 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-20 22:19:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:19:03,943 INFO L93 Difference]: Finished difference Result 202 states and 246 transitions. [2022-07-20 22:19:03,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:19:03,944 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-20 22:19:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:19:03,944 INFO L225 Difference]: With dead ends: 202 [2022-07-20 22:19:03,944 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 22:19:03,945 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-20 22:19:03,945 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 113 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:19:03,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 34 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:19:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 22:19:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-07-20 22:19:03,962 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-20 22:19:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-20 22:19:03,962 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 48 [2022-07-20 22:19:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:19:03,962 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-20 22:19:03,963 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-20 22:19:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-20 22:19:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 22:19:03,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:19:03,963 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-20 22:19:03,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-20 22:19:04,183 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-20 22:19:04,183 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:19:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:19:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash 663114381, now seen corresponding path program 13 times [2022-07-20 22:19:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:19:04,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909036967] [2022-07-20 22:19:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:19:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:05,022 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-20 22:19:05,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:19:05,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909036967] [2022-07-20 22:19:05,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909036967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:19:05,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840760938] [2022-07-20 22:19:05,023 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 22:19:05,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:19:05,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:19:05,024 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:19:05,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-20 22:19:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:05,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-20 22:19:05,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:19:05,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:19:05,129 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-20 22:19:05,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:19:05,420 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-20 22:19:05,533 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 22:19:05,534 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-20 22:19:05,678 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-20 22:19:05,678 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-20 22:19:05,842 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-20 22:19:05,842 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-20 22:19:06,048 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-20 22:19:06,049 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-20 22:19:06,200 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-20 22:19:06,201 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-20 22:19:06,252 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-20 22:19:06,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:20:13,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_395| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_393| Int) (v_ArrVal_1293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_395| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_393| 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse0 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (or (not (= 5 .cse0)) (let ((.cse2 (+ .cse3 .cse4 .cse5 .cse0 .cse6 .cse7)) (.cse1 (* c_~N~0 5))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse5 5)) (not (= 5 .cse6)) (not (= .cse3 5)) (not (= 5 .cse7))))))))))) is different from false