./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s32if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 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/s32if.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 371b46898ac196d32c6a3ef4c51b315e7fba4a376d0f69ff343a10a3b7c63d98 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:52:22,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:52:22,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:52:22,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:52:22,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:52:22,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:52:22,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:52:22,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:52:22,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:52:22,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:52:22,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:52:22,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:52:22,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:52:22,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:52:22,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:52:22,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:52:22,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:52:22,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:52:22,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:52:22,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:52:22,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:52:22,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:52:22,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:52:22,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:52:22,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:52:22,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:52:22,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:52:22,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:52:22,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:52:22,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:52:22,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:52:22,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:52:22,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:52:22,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:52:22,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:52:22,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:52:22,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:52:22,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:52:22,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:52:22,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:52:22,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:52:22,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 08:52:22,313 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:52:22,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:52:22,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:52:22,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:52:22,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:52:22,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:52:22,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:52:22,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:52:22,315 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:52:22,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:52:22,316 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:52:22,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 08:52:22,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:52:22,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:52:22,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:52:22,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:52:22,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:52:22,317 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:52:22,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:52:22,317 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:52:22,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:52:22,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:52:22,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:52:22,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:52:22,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:52:22,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:52:22,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:52:22,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:52:22,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 08:52:22,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 08:52:22,318 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:52:22,319 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:52:22,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:52:22,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:52:22,319 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 -> 371b46898ac196d32c6a3ef4c51b315e7fba4a376d0f69ff343a10a3b7c63d98 [2021-12-15 08:52:22,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:52:22,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:52:22,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:52:22,520 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:52:22,520 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:52:22,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s32if.c [2021-12-15 08:52:22,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff21add30/2c4aabd2f9284acda9c9ec8c0e7668c3/FLAG87f3d9582 [2021-12-15 08:52:22,913 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:52:22,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s32if.c [2021-12-15 08:52:22,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff21add30/2c4aabd2f9284acda9c9ec8c0e7668c3/FLAG87f3d9582 [2021-12-15 08:52:22,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff21add30/2c4aabd2f9284acda9c9ec8c0e7668c3 [2021-12-15 08:52:22,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:52:22,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:52:22,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:52:22,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:52:22,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:52:22,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:52:22" (1/1) ... [2021-12-15 08:52:22,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3533a447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:22, skipping insertion in model container [2021-12-15 08:52:22,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:52:22" (1/1) ... [2021-12-15 08:52:22,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:52:22,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:52:23,057 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/s32if.c[588,601] [2021-12-15 08:52:23,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:52:23,077 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:52:23,089 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/s32if.c[588,601] [2021-12-15 08:52:23,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:52:23,117 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:52:23,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23 WrapperNode [2021-12-15 08:52:23,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:52:23,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:52:23,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:52:23,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:52:23,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,150 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2021-12-15 08:52:23,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:52:23,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:52:23,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:52:23,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:52:23,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:52:23,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:52:23,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:52:23,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:52:23,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (1/1) ... [2021-12-15 08:52:23,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:52:23,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:23,195 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) [2021-12-15 08:52:23,203 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 [2021-12-15 08:52:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:52:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 08:52:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 08:52:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 08:52:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 08:52:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:52:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:52:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 08:52:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 08:52:23,274 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:52:23,275 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:52:23,408 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:52:23,411 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:52:23,412 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 08:52:23,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:52:23 BoogieIcfgContainer [2021-12-15 08:52:23,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:52:23,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:52:23,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:52:23,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:52:23,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:52:22" (1/3) ... [2021-12-15 08:52:23,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e15a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:52:23, skipping insertion in model container [2021-12-15 08:52:23,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:23" (2/3) ... [2021-12-15 08:52:23,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e15a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:52:23, skipping insertion in model container [2021-12-15 08:52:23,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:52:23" (3/3) ... [2021-12-15 08:52:23,418 INFO L111 eAbstractionObserver]: Analyzing ICFG s32if.c [2021-12-15 08:52:23,421 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:52:23,421 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:52:23,450 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:52:23,458 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 08:52:23,459 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:52:23,469 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) [2021-12-15 08:52:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 08:52:23,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:23,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:23,488 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2021-12-15 08:52:23,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:23,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364768146] [2021-12-15 08:52:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:23,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:52:23,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:23,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364768146] [2021-12-15 08:52:23,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364768146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:52:23,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:52:23,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 08:52:23,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360315583] [2021-12-15 08:52:23,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:52:23,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 08:52:23,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:23,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 08:52:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:52:23,649 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) [2021-12-15 08:52:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:23,661 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2021-12-15 08:52:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 08:52:23,664 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 [2021-12-15 08:52:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:23,668 INFO L225 Difference]: With dead ends: 42 [2021-12-15 08:52:23,669 INFO L226 Difference]: Without dead ends: 19 [2021-12-15 08:52:23,671 INFO L932 BasicCegarLoop]: 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 [2021-12-15 08:52:23,674 INFO L933 BasicCegarLoop]: 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 [2021-12-15 08:52:23,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:52:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-15 08:52:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-15 08:52:23,699 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) [2021-12-15 08:52:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-15 08:52:23,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2021-12-15 08:52:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:23,701 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-15 08:52:23,701 INFO L471 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) [2021-12-15 08:52:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-12-15 08:52:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 08:52:23,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:23,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:23,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 08:52:23,703 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2021-12-15 08:52:23,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:23,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966286677] [2021-12-15 08:52:23,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:23,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:52:23,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:23,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966286677] [2021-12-15 08:52:23,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966286677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:52:23,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:52:23,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:52:23,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101577882] [2021-12-15 08:52:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:52:23,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:52:23,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:23,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:52:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:52:23,800 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) [2021-12-15 08:52:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:23,861 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2021-12-15 08:52:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:52:23,862 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 [2021-12-15 08:52:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:23,863 INFO L225 Difference]: With dead ends: 39 [2021-12-15 08:52:23,863 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 08:52:23,867 INFO L932 BasicCegarLoop]: 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 [2021-12-15 08:52:23,868 INFO L933 BasicCegarLoop]: 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.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:23,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:52:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 08:52:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-15 08:52:23,875 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) [2021-12-15 08:52:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-15 08:52:23,876 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2021-12-15 08:52:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:23,877 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-15 08:52:23,877 INFO L471 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) [2021-12-15 08:52:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-15 08:52:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 08:52:23,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:23,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:23,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 08:52:23,878 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:23,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2021-12-15 08:52:23,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:23,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757900162] [2021-12-15 08:52:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:23,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:24,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:24,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757900162] [2021-12-15 08:52:24,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757900162] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:24,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332263717] [2021-12-15 08:52:24,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:24,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:24,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:24,155 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) [2021-12-15 08:52:24,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 08:52:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:24,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 08:52:24,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:24,284 INFO L388 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 [2021-12-15 08:52:24,293 INFO L388 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 [2021-12-15 08:52:24,328 INFO L388 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 [2021-12-15 08:52:24,413 INFO L388 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 [2021-12-15 08:52:24,485 INFO L388 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 [2021-12-15 08:52:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:24,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:24,702 WARN L838 $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 ((.cse0 (select v_ArrVal_46 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (= (+ (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) (* 4 c_~N~0))))) is different from false [2021-12-15 08:52:24,823 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:52:24,824 INFO L388 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 [2021-12-15 08:52:24,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:52:24,828 INFO L388 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 [2021-12-15 08:52:24,832 INFO L388 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 [2021-12-15 08:52:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-15 08:52:24,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332263717] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:24,842 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:24,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 20 [2021-12-15 08:52:24,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942328970] [2021-12-15 08:52:24,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:24,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 08:52:24,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:24,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 08:52:24,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=274, Unknown=2, NotChecked=34, Total=380 [2021-12-15 08:52:24,844 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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) [2021-12-15 08:52:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:25,125 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2021-12-15 08:52:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 08:52:25,126 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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 [2021-12-15 08:52:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:25,127 INFO L225 Difference]: With dead ends: 42 [2021-12-15 08:52:25,127 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 08:52:25,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=492, Unknown=2, NotChecked=48, Total=702 [2021-12-15 08:52:25,128 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:25,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 130 Invalid, 0 Unknown, 138 Unchecked, 0.1s Time] [2021-12-15 08:52:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 08:52:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2021-12-15 08:52:25,132 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) [2021-12-15 08:52:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-15 08:52:25,132 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2021-12-15 08:52:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:25,132 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-15 08:52:25,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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) [2021-12-15 08:52:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-15 08:52:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 08:52:25,133 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:25,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:25,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:25,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:25,344 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2021-12-15 08:52:25,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:25,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845609269] [2021-12-15 08:52:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:25,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:25,360 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:52:25,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790526401] [2021-12-15 08:52:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:25,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:25,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:25,362 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) [2021-12-15 08:52:25,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 08:52:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:25,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-15 08:52:25,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:25,449 INFO L388 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 [2021-12-15 08:52:25,483 INFO L388 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 [2021-12-15 08:52:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:25,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:25,542 INFO L388 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 [2021-12-15 08:52:25,546 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 08:52:25,548 INFO L388 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 [2021-12-15 08:52:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:25,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:25,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845609269] [2021-12-15 08:52:25,565 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:52:25,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790526401] [2021-12-15 08:52:25,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790526401] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:25,566 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:52:25,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-12-15 08:52:25,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372622747] [2021-12-15 08:52:25,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:25,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 08:52:25,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:25,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 08:52:25,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-15 08:52:25,568 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) [2021-12-15 08:52:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:25,682 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2021-12-15 08:52:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 08:52:25,683 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 [2021-12-15 08:52:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:25,684 INFO L225 Difference]: With dead ends: 58 [2021-12-15 08:52:25,684 INFO L226 Difference]: Without dead ends: 51 [2021-12-15 08:52:25,685 INFO L932 BasicCegarLoop]: 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 [2021-12-15 08:52:25,687 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:25,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 55 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:52:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-15 08:52:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2021-12-15 08:52:25,697 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) [2021-12-15 08:52:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2021-12-15 08:52:25,702 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2021-12-15 08:52:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:25,703 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-15 08:52:25,703 INFO L471 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) [2021-12-15 08:52:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2021-12-15 08:52:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 08:52:25,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:25,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:25,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:25,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-15 08:52:25,920 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2021-12-15 08:52:25,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:25,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608337649] [2021-12-15 08:52:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:25,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:26,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:26,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608337649] [2021-12-15 08:52:26,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608337649] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:26,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228616580] [2021-12-15 08:52:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:26,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:26,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:26,005 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) [2021-12-15 08:52:26,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 08:52:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:26,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 08:52:26,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:26,069 INFO L388 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 [2021-12-15 08:52:26,093 INFO L388 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 [2021-12-15 08:52:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:26,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:26,142 INFO L388 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 [2021-12-15 08:52:26,144 INFO L388 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 [2021-12-15 08:52:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:26,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228616580] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:26,155 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:26,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-15 08:52:26,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509899086] [2021-12-15 08:52:26,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:26,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 08:52:26,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:26,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 08:52:26,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-15 08:52:26,157 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:26,217 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2021-12-15 08:52:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 08:52:26,218 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 08:52:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:26,219 INFO L225 Difference]: With dead ends: 58 [2021-12-15 08:52:26,219 INFO L226 Difference]: Without dead ends: 46 [2021-12-15 08:52:26,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-15 08:52:26,220 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:26,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:52:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-15 08:52:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2021-12-15 08:52:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.25) internal successors, (50), 40 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) [2021-12-15 08:52:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2021-12-15 08:52:26,224 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 21 [2021-12-15 08:52:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:26,224 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2021-12-15 08:52:26,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2021-12-15 08:52:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 08:52:26,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:26,225 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:26,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:26,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:26,440 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2021-12-15 08:52:26,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:26,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362725476] [2021-12-15 08:52:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:26,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:26,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:26,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362725476] [2021-12-15 08:52:26,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362725476] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:26,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498307047] [2021-12-15 08:52:26,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:52:26,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:26,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:26,505 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) [2021-12-15 08:52:26,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 08:52:26,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:52:26,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:26,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:52:26,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:26,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:26,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498307047] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:26,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:26,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 08:52:26,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627430458] [2021-12-15 08:52:26,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:26,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 08:52:26,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:26,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 08:52:26,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 08:52:26,657 INFO L87 Difference]: Start difference. First operand 41 states and 50 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) [2021-12-15 08:52:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:26,769 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2021-12-15 08:52:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 08:52:26,769 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 [2021-12-15 08:52:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:26,770 INFO L225 Difference]: With dead ends: 69 [2021-12-15 08:52:26,770 INFO L226 Difference]: Without dead ends: 59 [2021-12-15 08:52:26,770 INFO L932 BasicCegarLoop]: 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 [2021-12-15 08:52:26,771 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:26,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 34 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:52:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-15 08:52:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2021-12-15 08:52:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2021-12-15 08:52:26,774 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 23 [2021-12-15 08:52:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:26,775 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2021-12-15 08:52:26,775 INFO L471 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) [2021-12-15 08:52:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2021-12-15 08:52:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 08:52:26,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:26,776 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:26,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:26,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:26,991 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:26,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2021-12-15 08:52:26,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:26,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022714623] [2021-12-15 08:52:26,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:26,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:27,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:27,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022714623] [2021-12-15 08:52:27,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022714623] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:27,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437424033] [2021-12-15 08:52:27,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:52:27,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:27,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:27,059 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) [2021-12-15 08:52:27,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 08:52:27,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 08:52:27,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:27,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:52:27,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:27,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:52:27,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437424033] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:27,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:27,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 08:52:27,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136293333] [2021-12-15 08:52:27,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:27,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 08:52:27,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:27,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 08:52:27,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 08:52:27,215 INFO L87 Difference]: Start difference. First operand 39 states and 47 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) [2021-12-15 08:52:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:27,289 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2021-12-15 08:52:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 08:52:27,290 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 [2021-12-15 08:52:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:27,290 INFO L225 Difference]: With dead ends: 73 [2021-12-15 08:52:27,290 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 08:52:27,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-15 08:52:27,291 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:27,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:52:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 08:52:27,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-12-15 08:52:27,294 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) [2021-12-15 08:52:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-12-15 08:52:27,295 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2021-12-15 08:52:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:27,295 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-15 08:52:27,295 INFO L471 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) [2021-12-15 08:52:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2021-12-15 08:52:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 08:52:27,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:27,296 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:27,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:27,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:27,512 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2021-12-15 08:52:27,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:27,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971345614] [2021-12-15 08:52:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:27,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 08:52:27,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:27,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971345614] [2021-12-15 08:52:27,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971345614] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:27,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046695377] [2021-12-15 08:52:27,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 08:52:27,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:27,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:27,838 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) [2021-12-15 08:52:27,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 08:52:27,885 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 08:52:27,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:27,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-15 08:52:27,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:27,898 INFO L388 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 [2021-12-15 08:52:27,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:27,920 INFO L388 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 [2021-12-15 08:52:27,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:27,949 INFO L388 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 [2021-12-15 08:52:28,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:28,045 INFO L388 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 [2021-12-15 08:52:28,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:28,071 INFO L388 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 [2021-12-15 08:52:28,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:28,134 INFO L388 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 [2021-12-15 08:52:28,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:28,227 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:52:28,227 INFO L388 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 [2021-12-15 08:52:28,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:28,399 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:52:28,399 INFO L388 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 [2021-12-15 08:52:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:52:28,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:28,700 WARN L838 $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 ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_208 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_63| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (= (+ .cse0 .cse1 .cse2) (* 4 c_~N~0)) (not (= 4 .cse1)) (not (= 4 .cse0)))))))) is different from false [2021-12-15 08:52:29,006 WARN L838 $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) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_63| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse0 (* .cse5 (- 1))) (.cse1 (* .cse4 (- 1))) (.cse2 (* .cse3 (- 1)))) (and (<= (+ |c_ULTIMATE.start_main_~i~0#1| 2) (div (+ .cse0 .cse1 .cse2 (- 1)) (- 4))) (<= (div (+ .cse0 .cse1 .cse2) (- 4)) (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (not (= 4 .cse3)) (not (= 4 .cse4)))))))) is different from false [2021-12-15 08:52:29,085 WARN L838 $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) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_63| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (let ((.cse2 (* .cse5 (- 1))) (.cse3 (* .cse1 (- 1))) (.cse4 (* .cse0 (- 1)))) (and (<= (div (+ .cse2 .cse3 .cse4) (- 4)) (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) (div (+ .cse2 .cse3 .cse4 (- 1)) (- 4))))))))))) is different from false [2021-12-15 08:52:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2021-12-15 08:52:29,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046695377] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:29,184 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:29,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 35 [2021-12-15 08:52:29,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635782866] [2021-12-15 08:52:29,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:29,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-15 08:52:29,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:29,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-15 08:52:29,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=868, Unknown=3, NotChecked=186, Total=1190 [2021-12-15 08:52:29,186 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:29,823 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2021-12-15 08:52:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 08:52:29,824 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 08:52:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:29,824 INFO L225 Difference]: With dead ends: 82 [2021-12-15 08:52:29,825 INFO L226 Difference]: Without dead ends: 78 [2021-12-15 08:52:29,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=330, Invalid=1659, Unknown=3, NotChecked=264, Total=2256 [2021-12-15 08:52:29,826 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:29,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 87 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 293 Invalid, 0 Unknown, 246 Unchecked, 0.2s Time] [2021-12-15 08:52:29,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-15 08:52:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2021-12-15 08:52:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2021-12-15 08:52:29,831 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2021-12-15 08:52:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:29,831 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2021-12-15 08:52:29,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2021-12-15 08:52:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 08:52:29,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:29,832 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:29,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-15 08:52:30,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:30,044 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:30,044 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2021-12-15 08:52:30,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:30,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577695954] [2021-12-15 08:52:30,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:30,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:30,052 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:52:30,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812825442] [2021-12-15 08:52:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:30,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:30,054 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) [2021-12-15 08:52:30,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 08:52:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:30,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-15 08:52:30,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:30,203 INFO L388 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 [2021-12-15 08:52:30,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:30,259 INFO L388 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 [2021-12-15 08:52:30,287 INFO L388 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 [2021-12-15 08:52:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 08:52:30,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:30,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (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)) 4)) is different from false [2021-12-15 08:52:30,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (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)) 4)) is different from false [2021-12-15 08:52:30,376 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:52:30,376 INFO L388 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 [2021-12-15 08:52:30,387 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:52:30,387 INFO L388 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 [2021-12-15 08:52:30,390 INFO L388 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 [2021-12-15 08:52:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2021-12-15 08:52:30,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:30,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577695954] [2021-12-15 08:52:30,447 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:52:30,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812825442] [2021-12-15 08:52:30,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812825442] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:30,448 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:52:30,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-15 08:52:30,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761285578] [2021-12-15 08:52:30,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:30,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 08:52:30,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:30,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 08:52:30,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2021-12-15 08:52:30,449 INFO L87 Difference]: Start difference. First operand 65 states and 82 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) [2021-12-15 08:52:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:30,635 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2021-12-15 08:52:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 08:52:30,635 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 [2021-12-15 08:52:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:30,636 INFO L225 Difference]: With dead ends: 113 [2021-12-15 08:52:30,636 INFO L226 Difference]: Without dead ends: 106 [2021-12-15 08:52:30,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=267, Unknown=2, NotChecked=70, Total=420 [2021-12-15 08:52:30,637 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:30,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 88 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 285 Invalid, 0 Unknown, 124 Unchecked, 0.1s Time] [2021-12-15 08:52:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-15 08:52:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2021-12-15 08:52:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.275) internal successors, (102), 80 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) [2021-12-15 08:52:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2021-12-15 08:52:30,643 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 29 [2021-12-15 08:52:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:30,643 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2021-12-15 08:52:30,643 INFO L471 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) [2021-12-15 08:52:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2021-12-15 08:52:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 08:52:30,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:30,644 INFO L514 BasicCegarLoop]: 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] [2021-12-15 08:52:30,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:30,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:30,859 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:30,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2021-12-15 08:52:30,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:30,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481418337] [2021-12-15 08:52:30,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:30,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:30,870 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:52:30,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437590161] [2021-12-15 08:52:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:30,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:30,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:30,886 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) [2021-12-15 08:52:30,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 08:52:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:30,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 08:52:30,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:30,962 INFO L388 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 [2021-12-15 08:52:30,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:31,000 INFO L388 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 [2021-12-15 08:52:31,016 INFO L388 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 [2021-12-15 08:52:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:52:31,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:31,112 INFO L388 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 [2021-12-15 08:52:31,116 INFO L388 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 [2021-12-15 08:52:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:52:31,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:31,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481418337] [2021-12-15 08:52:31,135 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:52:31,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437590161] [2021-12-15 08:52:31,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437590161] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:31,135 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:52:31,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-12-15 08:52:31,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125575697] [2021-12-15 08:52:31,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:31,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 08:52:31,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 08:52:31,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-15 08:52:31,136 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:31,245 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2021-12-15 08:52:31,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 08:52:31,246 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 08:52:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:31,246 INFO L225 Difference]: With dead ends: 123 [2021-12-15 08:52:31,247 INFO L226 Difference]: Without dead ends: 92 [2021-12-15 08:52:31,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-12-15 08:52:31,247 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:31,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:52:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-15 08:52:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2021-12-15 08:52:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2021-12-15 08:52:31,253 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 29 [2021-12-15 08:52:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:31,254 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2021-12-15 08:52:31,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2021-12-15 08:52:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 08:52:31,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:31,255 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:31,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:31,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-15 08:52:31,468 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:31,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:31,468 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2021-12-15 08:52:31,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:31,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433138165] [2021-12-15 08:52:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:31,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:52:31,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:31,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433138165] [2021-12-15 08:52:31,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433138165] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:31,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200285749] [2021-12-15 08:52:31,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 08:52:31,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:31,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:31,517 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) [2021-12-15 08:52:31,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 08:52:31,574 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-15 08:52:31,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:31,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 08:52:31,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:52:31,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:52:31,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200285749] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:31,693 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:31,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 08:52:31,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319429149] [2021-12-15 08:52:31,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:31,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 08:52:31,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:31,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 08:52:31,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 08:52:31,694 INFO L87 Difference]: Start difference. First operand 81 states and 100 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) [2021-12-15 08:52:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:31,842 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2021-12-15 08:52:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 08:52:31,843 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 [2021-12-15 08:52:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:31,843 INFO L225 Difference]: With dead ends: 115 [2021-12-15 08:52:31,844 INFO L226 Difference]: Without dead ends: 102 [2021-12-15 08:52:31,844 INFO L932 BasicCegarLoop]: 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 [2021-12-15 08:52:31,844 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 73 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:31,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 33 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:52:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-15 08:52:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2021-12-15 08:52:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2021-12-15 08:52:31,850 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 31 [2021-12-15 08:52:31,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:31,850 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2021-12-15 08:52:31,850 INFO L471 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) [2021-12-15 08:52:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2021-12-15 08:52:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 08:52:31,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:31,851 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:31,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:32,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:32,068 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2021-12-15 08:52:32,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:32,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175927774] [2021-12-15 08:52:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:32,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:52:32,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:32,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175927774] [2021-12-15 08:52:32,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175927774] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:32,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599104051] [2021-12-15 08:52:32,114 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 08:52:32,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:32,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:32,115 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) [2021-12-15 08:52:32,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 08:52:32,173 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-15 08:52:32,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:32,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 08:52:32,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:52:32,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:52:32,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599104051] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:32,321 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:32,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 08:52:32,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542649541] [2021-12-15 08:52:32,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:32,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 08:52:32,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 08:52:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 08:52:32,323 INFO L87 Difference]: Start difference. First operand 80 states and 100 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) [2021-12-15 08:52:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:32,436 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2021-12-15 08:52:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 08:52:32,436 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 [2021-12-15 08:52:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:32,437 INFO L225 Difference]: With dead ends: 103 [2021-12-15 08:52:32,437 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 08:52:32,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:52:32,438 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:32,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 46 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:52:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 08:52:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-15 08:52:32,440 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) [2021-12-15 08:52:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-15 08:52:32,440 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2021-12-15 08:52:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:32,440 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-15 08:52:32,440 INFO L471 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) [2021-12-15 08:52:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-15 08:52:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 08:52:32,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:32,441 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:32,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:32,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-15 08:52:32,651 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:32,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2021-12-15 08:52:32,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:32,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960209412] [2021-12-15 08:52:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:32,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 08:52:33,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:33,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960209412] [2021-12-15 08:52:33,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960209412] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:33,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856741883] [2021-12-15 08:52:33,140 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 08:52:33,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:33,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:33,156 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) [2021-12-15 08:52:33,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 08:52:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:33,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-15 08:52:33,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:33,226 INFO L388 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 [2021-12-15 08:52:33,228 INFO L388 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 [2021-12-15 08:52:33,240 INFO L388 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 [2021-12-15 08:52:33,269 INFO L388 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 [2021-12-15 08:52:33,298 INFO L388 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 [2021-12-15 08:52:33,374 INFO L388 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 [2021-12-15 08:52:33,409 INFO L388 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 [2021-12-15 08:52:33,438 INFO L388 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 [2021-12-15 08:52:33,507 INFO L388 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 [2021-12-15 08:52:33,596 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:52:33,596 INFO L388 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 [2021-12-15 08:52:33,710 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:52:33,710 INFO L388 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 [2021-12-15 08:52:33,834 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:52:33,835 INFO L388 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 58 treesize of output 30 [2021-12-15 08:52:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:52:33,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:36,988 WARN L838 $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 ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_438 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_130| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_128| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (= (+ .cse0 .cse3 .cse2 .cse1) (* 4 c_~N~0))))))))) is different from false [2021-12-15 08:52:37,171 WARN L838 $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 ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_438 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_130| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_128| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (= (+ .cse0 .cse1 .cse2 .cse3) (* 4 c_~N~0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (not (= 4 .cse0))))))))) is different from false [2021-12-15 08:52:37,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (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 ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_438 (+ (* |v_ULTIMATE.start_main_~i~0#1_137| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_130| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_128| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (= (+ .cse0 .cse1 .cse2 .cse3) (* 4 ~N~0)) (not (= 4 .cse3)) (not (= 4 .cse0)) (not (= 4 .cse2))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))) is different from false [2021-12-15 08:52:37,888 WARN L838 $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 ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_438 (+ (* |v_ULTIMATE.start_main_~i~0#1_137| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_130| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_128| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (= (+ .cse0 .cse1 .cse2 .cse3) (* 4 ~N~0)) (not (= 4 .cse3)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (= 4 .cse0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse2))))))))) is different from false [2021-12-15 08:52:38,125 WARN L838 $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 ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_438 (+ (* |v_ULTIMATE.start_main_~i~0#1_137| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_130| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_128| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (= (+ .cse0 .cse1 .cse2 .cse3) (* 4 ~N~0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse3)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse0)) (not (= 4 .cse2))))))))) is different from false [2021-12-15 08:52:38,250 WARN L838 $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 ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_438 (+ (* |v_ULTIMATE.start_main_~i~0#1_137| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_130| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_128| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (+ .cse0 .cse1 .cse2 .cse3) (* 4 ~N~0)) (not (= 4 .cse3)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse0)) (not (= 4 .cse2))))))))) is different from false [2021-12-15 08:52:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 19 not checked. [2021-12-15 08:52:38,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856741883] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:38,274 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:38,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 18] total 45 [2021-12-15 08:52:38,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141168144] [2021-12-15 08:52:38,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:38,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-15 08:52:38,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:38,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-15 08:52:38,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1342, Unknown=7, NotChecked=474, Total=1980 [2021-12-15 08:52:38,276 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 45 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:39,531 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2021-12-15 08:52:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-15 08:52:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-15 08:52:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:39,532 INFO L225 Difference]: With dead ends: 105 [2021-12-15 08:52:39,532 INFO L226 Difference]: Without dead ends: 101 [2021-12-15 08:52:39,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 55 SyntacticMatches, 13 SemanticMatches, 61 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=436, Invalid=2773, Unknown=7, NotChecked=690, Total=3906 [2021-12-15 08:52:39,534 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 837 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:39,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 143 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 503 Invalid, 0 Unknown, 837 Unchecked, 0.3s Time] [2021-12-15 08:52:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-15 08:52:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2021-12-15 08:52:39,539 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) [2021-12-15 08:52:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2021-12-15 08:52:39,540 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 37 [2021-12-15 08:52:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:39,540 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2021-12-15 08:52:39,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2021-12-15 08:52:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 08:52:39,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:39,541 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:39,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:39,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-15 08:52:39,750 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:39,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:39,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2021-12-15 08:52:39,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:39,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096722177] [2021-12-15 08:52:39,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:39,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:39,758 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:52:39,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1057361766] [2021-12-15 08:52:39,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:52:39,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:39,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:39,759 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) [2021-12-15 08:52:39,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 08:52:39,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:52:39,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:39,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 08:52:39,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:39,965 INFO L388 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 [2021-12-15 08:52:40,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:40,028 INFO L388 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 [2021-12-15 08:52:40,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:40,069 INFO L388 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 [2021-12-15 08:52:40,107 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:52:40,107 INFO L388 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 21 treesize of output 21 [2021-12-15 08:52:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:52:40,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:40,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_498 (Array Int Int))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|) (= 4 (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) c_~N~0))) is different from false [2021-12-15 08:52:40,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_498 (Array Int Int))) (or (= 4 (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) |v_ULTIMATE.start_main_~i~0#1_149|) (< (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) c_~N~0))) is different from false [2021-12-15 08:52:40,521 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:52:40,521 INFO L388 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 49 treesize of output 33 [2021-12-15 08:52:40,528 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:52:40,528 INFO L388 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 44 treesize of output 44 [2021-12-15 08:52:40,538 INFO L388 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 7 [2021-12-15 08:52:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-15 08:52:40,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:40,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096722177] [2021-12-15 08:52:40,841 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:52:40,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057361766] [2021-12-15 08:52:40,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057361766] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:40,841 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:52:40,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2021-12-15 08:52:40,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270809864] [2021-12-15 08:52:40,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:40,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 08:52:40,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:40,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 08:52:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=798, Unknown=10, NotChecked=122, Total=1122 [2021-12-15 08:52:40,842 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:41,305 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2021-12-15 08:52:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 08:52:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-15 08:52:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:41,306 INFO L225 Difference]: With dead ends: 143 [2021-12-15 08:52:41,306 INFO L226 Difference]: Without dead ends: 136 [2021-12-15 08:52:41,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=1345, Unknown=11, NotChecked=162, Total=1892 [2021-12-15 08:52:41,307 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 206 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:41,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 67 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 417 Invalid, 0 Unknown, 233 Unchecked, 0.3s Time] [2021-12-15 08:52:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-15 08:52:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 111. [2021-12-15 08:52:41,314 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) [2021-12-15 08:52:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2021-12-15 08:52:41,314 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 37 [2021-12-15 08:52:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:41,314 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2021-12-15 08:52:41,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2021-12-15 08:52:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 08:52:41,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:41,315 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:41,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:41,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-15 08:52:41,519 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2021-12-15 08:52:41,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:41,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872341391] [2021-12-15 08:52:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:41,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:41,528 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:52:41,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91426792] [2021-12-15 08:52:41,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:52:41,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:41,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:41,530 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) [2021-12-15 08:52:41,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-15 08:52:41,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 08:52:41,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:41,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-15 08:52:41,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:41,634 INFO L388 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 [2021-12-15 08:52:41,689 INFO L354 Elim1Store]: treesize reduction 59, result has 16.9 percent of original size [2021-12-15 08:52:41,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 32 [2021-12-15 08:52:41,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:41,805 INFO L388 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 30 treesize of output 30 [2021-12-15 08:52:41,853 INFO L354 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2021-12-15 08:52:41,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 36 [2021-12-15 08:52:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-15 08:52:41,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:42,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_553 (Array Int Int))) (or (= 4 (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|))) (<= c_~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (< (+ |ULTIMATE.start_main_~i~0#1| 2) c_~N~0))) is different from false [2021-12-15 08:52:42,908 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:52:42,908 INFO L388 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 115 treesize of output 104 [2021-12-15 08:52:42,913 INFO L388 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 83 treesize of output 79 [2021-12-15 08:52:42,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:52:42,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:42,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:52:42,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 19 [2021-12-15 08:52:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2021-12-15 08:52:42,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:42,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872341391] [2021-12-15 08:52:42,957 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:52:42,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91426792] [2021-12-15 08:52:42,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91426792] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:42,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:52:42,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2021-12-15 08:52:42,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324614854] [2021-12-15 08:52:42,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:42,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-15 08:52:42,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-15 08:52:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=586, Unknown=7, NotChecked=50, Total=756 [2021-12-15 08:52:42,959 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 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) [2021-12-15 08:52:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:43,977 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2021-12-15 08:52:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 08:52:43,978 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 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 [2021-12-15 08:52:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:43,978 INFO L225 Difference]: With dead ends: 129 [2021-12-15 08:52:43,978 INFO L226 Difference]: Without dead ends: 125 [2021-12-15 08:52:43,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=186, Invalid=933, Unknown=7, NotChecked=64, Total=1190 [2021-12-15 08:52:43,979 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:43,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 63 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 111 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2021-12-15 08:52:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-15 08:52:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2021-12-15 08:52:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 116 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2021-12-15 08:52:43,996 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 37 [2021-12-15 08:52:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:43,997 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2021-12-15 08:52:43,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 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) [2021-12-15 08:52:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2021-12-15 08:52:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 08:52:43,998 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:43,998 INFO L514 BasicCegarLoop]: 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] [2021-12-15 08:52:44,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:44,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 08:52:44,207 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:44,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2021-12-15 08:52:44,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:44,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46648277] [2021-12-15 08:52:44,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:44,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:44,216 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:52:44,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938865078] [2021-12-15 08:52:44,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:52:44,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:44,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:44,217 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) [2021-12-15 08:52:44,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 08:52:44,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:52:44,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:44,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-15 08:52:44,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:44,315 INFO L388 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 [2021-12-15 08:52:44,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:44,353 INFO L388 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 [2021-12-15 08:52:44,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:44,379 INFO L388 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 [2021-12-15 08:52:44,398 INFO L388 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 [2021-12-15 08:52:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:52:44,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:44,519 INFO L388 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 [2021-12-15 08:52:44,521 INFO L388 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 [2021-12-15 08:52:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:52:44,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:44,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46648277] [2021-12-15 08:52:44,554 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:52:44,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938865078] [2021-12-15 08:52:44,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938865078] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:44,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:52:44,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-12-15 08:52:44,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881175505] [2021-12-15 08:52:44,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:44,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 08:52:44,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:44,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 08:52:44,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:52:44,555 INFO L87 Difference]: Start difference. First operand 117 states and 147 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) [2021-12-15 08:52:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:44,763 INFO L93 Difference]: Finished difference Result 176 states and 227 transitions. [2021-12-15 08:52:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 08:52:44,763 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 [2021-12-15 08:52:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:44,764 INFO L225 Difference]: With dead ends: 176 [2021-12-15 08:52:44,764 INFO L226 Difference]: Without dead ends: 131 [2021-12-15 08:52:44,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-12-15 08:52:44,765 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:44,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 08:52:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-15 08:52:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 117. [2021-12-15 08:52:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.25) internal successors, (145), 116 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:52:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2021-12-15 08:52:44,773 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 37 [2021-12-15 08:52:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:44,773 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2021-12-15 08:52:44,773 INFO L471 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) [2021-12-15 08:52:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2021-12-15 08:52:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 08:52:44,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:44,774 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:44,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:44,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:44,994 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2021-12-15 08:52:44,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:44,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65873775] [2021-12-15 08:52:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:44,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:52:45,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:45,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65873775] [2021-12-15 08:52:45,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65873775] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:45,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006078171] [2021-12-15 08:52:45,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:52:45,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:45,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:45,087 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) [2021-12-15 08:52:45,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-15 08:52:45,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:52:45,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:45,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 08:52:45,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:52:45,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:52:45,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006078171] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:45,321 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:45,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-15 08:52:45,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611958671] [2021-12-15 08:52:45,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:45,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 08:52:45,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:45,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 08:52:45,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:52:45,322 INFO L87 Difference]: Start difference. First operand 117 states and 145 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) [2021-12-15 08:52:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:45,616 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2021-12-15 08:52:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 08:52:45,617 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 [2021-12-15 08:52:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:45,618 INFO L225 Difference]: With dead ends: 162 [2021-12-15 08:52:45,618 INFO L226 Difference]: Without dead ends: 141 [2021-12-15 08:52:45,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-15 08:52:45,619 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 103 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:45,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 34 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 08:52:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-15 08:52:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2021-12-15 08:52:45,625 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) [2021-12-15 08:52:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2021-12-15 08:52:45,625 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2021-12-15 08:52:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:45,625 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2021-12-15 08:52:45,625 INFO L471 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) [2021-12-15 08:52:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2021-12-15 08:52:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 08:52:45,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:45,626 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:45,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:45,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-15 08:52:45,827 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:45,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2021-12-15 08:52:45,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:45,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601916161] [2021-12-15 08:52:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:45,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:52:45,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:45,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601916161] [2021-12-15 08:52:45,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601916161] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:45,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41284139] [2021-12-15 08:52:45,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:52:45,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:45,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:45,905 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) [2021-12-15 08:52:45,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-15 08:52:45,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 08:52:45,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:45,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 08:52:45,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:52:46,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 08:52:46,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41284139] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:52:46,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:52:46,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-15 08:52:46,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444669716] [2021-12-15 08:52:46,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:52:46,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 08:52:46,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:52:46,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 08:52:46,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:52:46,152 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) [2021-12-15 08:52:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:52:46,296 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2021-12-15 08:52:46,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 08:52:46,296 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 [2021-12-15 08:52:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:52:46,297 INFO L225 Difference]: With dead ends: 131 [2021-12-15 08:52:46,297 INFO L226 Difference]: Without dead ends: 58 [2021-12-15 08:52:46,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-15 08:52:46,298 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 107 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:52:46,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 27 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:52:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-15 08:52:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-15 08:52:46,301 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) [2021-12-15 08:52:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2021-12-15 08:52:46,302 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2021-12-15 08:52:46,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:52:46,302 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2021-12-15 08:52:46,302 INFO L471 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) [2021-12-15 08:52:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-12-15 08:52:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 08:52:46,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:52:46,303 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:52:46,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-15 08:52:46,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-15 08:52:46,520 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:52:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:52:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2021-12-15 08:52:46,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:52:46,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124553991] [2021-12-15 08:52:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:52:46,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:52:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:52:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-15 08:52:46,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:52:46,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124553991] [2021-12-15 08:52:46,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124553991] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:52:46,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54016731] [2021-12-15 08:52:46,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 08:52:47,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:52:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:52:47,000 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) [2021-12-15 08:52:47,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-15 08:52:47,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 08:52:47,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:52:47,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-15 08:52:47,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:52:47,077 INFO L388 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 [2021-12-15 08:52:47,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,107 INFO L388 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 [2021-12-15 08:52:47,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,145 INFO L388 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 [2021-12-15 08:52:47,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,190 INFO L388 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 [2021-12-15 08:52:47,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,235 INFO L388 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 [2021-12-15 08:52:47,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,347 INFO L388 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 [2021-12-15 08:52:47,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,371 INFO L388 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 [2021-12-15 08:52:47,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,398 INFO L388 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 [2021-12-15 08:52:47,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,421 INFO L388 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 [2021-12-15 08:52:47,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,496 INFO L388 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 [2021-12-15 08:52:47,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,607 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:52:47,607 INFO L388 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 [2021-12-15 08:52:47,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,737 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:52:47,737 INFO L388 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 [2021-12-15 08:52:47,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:47,877 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:52:47,877 INFO L388 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 [2021-12-15 08:52:48,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:52:48,017 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:52:48,017 INFO L388 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 83 treesize of output 35 [2021-12-15 08:52:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-15 08:52:48,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:52:57,764 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1))) |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 ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_239| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (= (+ .cse3 .cse2 .cse0 .cse4 .cse1) (* 4 c_~N~0)) (not (= 4 .cse4)))))))))) is different from false [2021-12-15 08:52:58,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse1))) |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 .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_239| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse2 .cse0 .cse3 .cse4 .cse1) (* 4 c_~N~0)) (not (= 4 .cse3)) (not (= 4 .cse4)))))))))) is different from false [2021-12-15 08:53:00,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|v_ULTIMATE.start_main_~i~0#1_251| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ (* |v_ULTIMATE.start_main_~i~0#1_251| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0))) |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 .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_239| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (= (+ .cse1 .cse2 .cse0 .cse3 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (not (= 4 .cse4)) (not (= 4 .cse3)))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))) is different from false [2021-12-15 08:53:00,903 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| 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_243| Int) (|v_ULTIMATE.start_main_~i~0#1_251| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ (* |v_ULTIMATE.start_main_~i~0#1_251| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0))) |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 .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_239| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (+ .cse1 .cse2 .cse0 .cse3 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (not (= 4 .cse4)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 08:53:01,298 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| 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_243| Int) (|v_ULTIMATE.start_main_~i~0#1_251| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ (* |v_ULTIMATE.start_main_~i~0#1_251| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0))) |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 .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_239| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (= (+ .cse1 .cse2 .cse0 .cse3 .cse4) (* 4 ~N~0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (= 4 .cse2)) (not (= 4 .cse4)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 08:53:01,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| 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_243| Int) (|v_ULTIMATE.start_main_~i~0#1_251| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ (* |v_ULTIMATE.start_main_~i~0#1_251| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0))) |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 .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_239| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse0)) (= (+ .cse1 .cse2 .cse0 .cse3 .cse4) (* 4 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse2)) (not (= 4 .cse4)) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 08:53:02,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| 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_243| Int) (|v_ULTIMATE.start_main_~i~0#1_251| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ (* |v_ULTIMATE.start_main_~i~0#1_251| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0))) |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 .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_239| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 4 .cse0)) (= (+ .cse1 .cse2 .cse0 .cse3 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (not (= 4 .cse4)) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 08:53:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 31 not checked. [2021-12-15 08:53:02,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54016731] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:02,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:02,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 21] total 55 [2021-12-15 08:53:02,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017275827] [2021-12-15 08:53:02,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:02,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-15 08:53:02,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-15 08:53:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2091, Unknown=12, NotChecked=686, Total=2970 [2021-12-15 08:53:02,855 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 55 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 55 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:04,494 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2021-12-15 08:53:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 08:53:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 55 states have internal predecessors, (100), 0 states have call successors, (0), 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 [2021-12-15 08:53:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:04,495 INFO L225 Difference]: With dead ends: 87 [2021-12-15 08:53:04,495 INFO L226 Difference]: Without dead ends: 83 [2021-12-15 08:53:04,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=266, Invalid=2830, Unknown=12, NotChecked=798, Total=3906 [2021-12-15 08:53:04,496 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 478 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:04,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 187 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 254 Invalid, 0 Unknown, 478 Unchecked, 0.1s Time] [2021-12-15 08:53:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-15 08:53:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2021-12-15 08:53:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 79 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2021-12-15 08:53:04,501 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 45 [2021-12-15 08:53:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:04,501 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2021-12-15 08:53:04,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 55 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2021-12-15 08:53:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 08:53:04,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:04,502 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:04,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:04,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:04,703 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:04,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 4 times [2021-12-15 08:53:04,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:04,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473977838] [2021-12-15 08:53:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:04,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:04,712 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:53:04,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711574370] [2021-12-15 08:53:04,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 08:53:04,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:04,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:04,713 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) [2021-12-15 08:53:04,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-15 08:53:04,780 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 08:53:04,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:04,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-15 08:53:04,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:04,894 INFO L388 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 [2021-12-15 08:53:04,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:04,944 INFO L388 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 [2021-12-15 08:53:04,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:04,984 INFO L388 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 [2021-12-15 08:53:05,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:05,018 INFO L388 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 [2021-12-15 08:53:05,057 INFO L388 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 [2021-12-15 08:53:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 08:53:05,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:05,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= 4 (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 [2021-12-15 08:53:05,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= 4 (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| 8)))) is different from false [2021-12-15 08:53:05,123 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= 4 (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| 12)))) is different from false [2021-12-15 08:53:05,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= 4 (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_~a~0#1.offset| 12)))) is different from false [2021-12-15 08:53:05,163 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:05,164 INFO L388 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 [2021-12-15 08:53:05,168 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:05,169 INFO L388 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 [2021-12-15 08:53:05,171 INFO L388 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 [2021-12-15 08:53:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2021-12-15 08:53:05,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:05,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473977838] [2021-12-15 08:53:05,293 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:53:05,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711574370] [2021-12-15 08:53:05,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711574370] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:05,293 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:53:05,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2021-12-15 08:53:05,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904322484] [2021-12-15 08:53:05,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:05,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-15 08:53:05,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-15 08:53:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2021-12-15 08:53:05,294 INFO L87 Difference]: Start difference. First operand 80 states and 95 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) [2021-12-15 08:53:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:05,740 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2021-12-15 08:53:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 08:53:05,741 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 [2021-12-15 08:53:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:05,741 INFO L225 Difference]: With dead ends: 155 [2021-12-15 08:53:05,741 INFO L226 Difference]: Without dead ends: 148 [2021-12-15 08:53:05,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=533, Unknown=4, NotChecked=204, Total=870 [2021-12-15 08:53:05,743 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 125 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:05,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 89 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 470 Invalid, 0 Unknown, 321 Unchecked, 0.3s Time] [2021-12-15 08:53:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-15 08:53:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 110. [2021-12-15 08:53:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2021-12-15 08:53:05,756 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 45 [2021-12-15 08:53:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:05,756 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2021-12-15 08:53:05,756 INFO L471 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) [2021-12-15 08:53:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2021-12-15 08:53:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 08:53:05,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:05,757 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:05,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:05,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:05,969 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 5 times [2021-12-15 08:53:05,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:05,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751217947] [2021-12-15 08:53:05,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:05,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:05,977 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:53:05,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040285889] [2021-12-15 08:53:05,978 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 08:53:05,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:05,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:05,979 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) [2021-12-15 08:53:05,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-15 08:53:06,119 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-15 08:53:06,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:06,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-15 08:53:06,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:06,128 INFO L388 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 [2021-12-15 08:53:06,200 INFO L388 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 [2021-12-15 08:53:06,247 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-15 08:53:06,247 INFO L388 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 [2021-12-15 08:53:06,297 INFO L388 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 [2021-12-15 08:53:06,325 INFO L388 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 [2021-12-15 08:53:06,349 INFO L388 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 [2021-12-15 08:53:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-15 08:53:06,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:06,403 WARN L838 $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)) 4)) is different from false [2021-12-15 08:53:06,419 WARN L838 $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| 8)) 4)) is different from false [2021-12-15 08:53:06,428 WARN L838 $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_~a~0#1.offset| 8)) 4)) is different from false [2021-12-15 08:53:06,437 WARN L838 $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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)) is different from false [2021-12-15 08:53:06,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_288| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_288| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_288| 4)) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)))) is different from false [2021-12-15 08:53:08,093 INFO L354 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2021-12-15 08:53:08,094 INFO L388 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 [2021-12-15 08:53:08,099 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:08,099 INFO L388 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 [2021-12-15 08:53:08,101 INFO L388 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 [2021-12-15 08:53:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 22 not checked. [2021-12-15 08:53:08,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:08,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751217947] [2021-12-15 08:53:08,163 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:53:08,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040285889] [2021-12-15 08:53:08,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040285889] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:08,163 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:53:08,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2021-12-15 08:53:08,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914918760] [2021-12-15 08:53:08,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:08,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-15 08:53:08,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:08,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-15 08:53:08,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=5, NotChecked=180, Total=506 [2021-12-15 08:53:08,164 INFO L87 Difference]: Start difference. First operand 110 states and 133 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) [2021-12-15 08:53:10,212 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_288| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_288| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_288| 4)) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 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|)) 4) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2021-12-15 08:53:12,233 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_288| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_288| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_288| 4)) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4) (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_~a~0#1.offset| 8)) 4)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))) is different from false [2021-12-15 08:53:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:12,349 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2021-12-15 08:53:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 08:53:12,349 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 [2021-12-15 08:53:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:12,350 INFO L225 Difference]: With dead ends: 146 [2021-12-15 08:53:12,350 INFO L226 Difference]: Without dead ends: 134 [2021-12-15 08:53:12,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=83, Invalid=318, Unknown=7, NotChecked=294, Total=702 [2021-12-15 08:53:12,351 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:12,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 68 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 172 Invalid, 0 Unknown, 232 Unchecked, 0.1s Time] [2021-12-15 08:53:12,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-15 08:53:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2021-12-15 08:53:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.2153846153846153) internal successors, (158), 130 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 158 transitions. [2021-12-15 08:53:12,360 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 158 transitions. Word has length 45 [2021-12-15 08:53:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:12,360 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 158 transitions. [2021-12-15 08:53:12,360 INFO L471 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) [2021-12-15 08:53:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 158 transitions. [2021-12-15 08:53:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 08:53:12,361 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:12,361 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:12,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:12,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:12,571 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1853695216, now seen corresponding path program 6 times [2021-12-15 08:53:12,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:12,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424260271] [2021-12-15 08:53:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:12,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:12,579 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:53:12,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896538593] [2021-12-15 08:53:12,579 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 08:53:12,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:12,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:12,581 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) [2021-12-15 08:53:12,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-15 08:53:12,696 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-15 08:53:12,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:12,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-15 08:53:12,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:12,707 INFO L388 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 [2021-12-15 08:53:12,836 INFO L388 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 [2021-12-15 08:53:12,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:12,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-15 08:53:12,939 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-12-15 08:53:12,939 INFO L388 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 30 [2021-12-15 08:53:13,028 INFO L388 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 [2021-12-15 08:53:13,059 INFO L388 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 [2021-12-15 08:53:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 08:53:13,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:13,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |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)) is different from false [2021-12-15 08:53:13,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-15 08:53:13,197 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int 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|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)))) is different from false [2021-12-15 08:53:13,224 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_999 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_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_999) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< (+ |v_ULTIMATE.start_main_~i~0#1_310| 1) c_~N~0))) is different from false [2021-12-15 08:53:13,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_999 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_999) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< (+ |v_ULTIMATE.start_main_~i~0#1_310| 1) c_~N~0))) (< |v_ULTIMATE.start_main_~i~0#1_311| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-15 08:53:13,380 INFO L354 Elim1Store]: treesize reduction 104, result has 35.4 percent of original size [2021-12-15 08:53:13,381 INFO L388 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 61 treesize of output 73 [2021-12-15 08:53:13,400 INFO L354 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-15 08:53:13,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 66 [2021-12-15 08:53:13,406 INFO L388 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 [2021-12-15 08:53:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 19 not checked. [2021-12-15 08:53:13,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424260271] [2021-12-15 08:53:13,621 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:53:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896538593] [2021-12-15 08:53:13,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896538593] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:13,621 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:53:13,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2021-12-15 08:53:13,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640130566] [2021-12-15 08:53:13,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:13,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-15 08:53:13,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:13,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-15 08:53:13,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=714, Unknown=5, NotChecked=300, Total=1190 [2021-12-15 08:53:13,622 INFO L87 Difference]: Start difference. First operand 131 states and 158 transitions. Second operand has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 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) [2021-12-15 08:53:15,698 WARN L838 $PredicateComparison]: unable to prove that (and (= (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|)) 4) (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_999 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_999) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< (+ |v_ULTIMATE.start_main_~i~0#1_310| 1) c_~N~0))) (< |v_ULTIMATE.start_main_~i~0#1_311| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2021-12-15 08:53:17,719 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (< 2 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_999 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_999) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< (+ |v_ULTIMATE.start_main_~i~0#1_310| 1) c_~N~0))) (< |v_ULTIMATE.start_main_~i~0#1_311| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int 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|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))))) is different from false [2021-12-15 08:53:19,722 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_999 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_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_999) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< (+ |v_ULTIMATE.start_main_~i~0#1_310| 1) c_~N~0))) (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (< 2 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int 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|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))))) is different from false [2021-12-15 08:53:33,753 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (< 2 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_1002 Int) (v_ArrVal_1003 (Array Int 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|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1002)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))))) is different from false [2021-12-15 08:53:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:33,884 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2021-12-15 08:53:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 08:53:33,885 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 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 [2021-12-15 08:53:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:33,885 INFO L225 Difference]: With dead ends: 167 [2021-12-15 08:53:33,885 INFO L226 Difference]: Without dead ends: 149 [2021-12-15 08:53:33,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=230, Invalid=987, Unknown=9, NotChecked=666, Total=1892 [2021-12-15 08:53:33,886 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:33,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 107 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 245 Invalid, 0 Unknown, 288 Unchecked, 0.1s Time] [2021-12-15 08:53:33,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-15 08:53:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 126. [2021-12-15 08:53:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.192) internal successors, (149), 125 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2021-12-15 08:53:33,895 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 45 [2021-12-15 08:53:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:33,896 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2021-12-15 08:53:33,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 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) [2021-12-15 08:53:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2021-12-15 08:53:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 08:53:33,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:33,896 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:33,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:34,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-15 08:53:34,097 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:34,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:34,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1365458192, now seen corresponding path program 1 times [2021-12-15 08:53:34,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:34,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221341526] [2021-12-15 08:53:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:34,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-15 08:53:34,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:34,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221341526] [2021-12-15 08:53:34,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221341526] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:34,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917334529] [2021-12-15 08:53:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:34,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:34,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:34,621 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) [2021-12-15 08:53:34,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-15 08:53:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:34,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-15 08:53:34,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:34,806 INFO L388 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 [2021-12-15 08:53:34,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:34,877 INFO L388 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 [2021-12-15 08:53:34,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:34,922 INFO L388 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 [2021-12-15 08:53:34,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:34,967 INFO L388 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 [2021-12-15 08:53:35,004 INFO L388 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 [2021-12-15 08:53:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-15 08:53:35,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:35,403 INFO L388 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 [2021-12-15 08:53:35,405 INFO L388 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 [2021-12-15 08:53:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-15 08:53:35,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917334529] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:35,510 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:35,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12, 12] total 41 [2021-12-15 08:53:35,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507669519] [2021-12-15 08:53:35,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:35,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-15 08:53:35,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:35,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-15 08:53:35,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1526, Unknown=0, NotChecked=0, Total=1640 [2021-12-15 08:53:35,512 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 41 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)