./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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-tiling/nr5.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 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 09:34:28,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 09:34:28,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 09:34:28,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 09:34:28,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 09:34:28,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 09:34:28,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 09:34:28,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 09:34:28,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 09:34:28,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 09:34:28,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 09:34:28,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 09:34:28,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 09:34:28,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 09:34:28,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 09:34:28,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 09:34:28,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 09:34:28,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 09:34:28,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 09:34:28,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 09:34:28,183 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 09:34:28,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 09:34:28,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 09:34:28,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 09:34:28,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 09:34:28,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 09:34:28,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 09:34:28,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 09:34:28,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 09:34:28,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 09:34:28,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 09:34:28,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 09:34:28,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 09:34:28,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 09:34:28,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 09:34:28,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 09:34:28,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 09:34:28,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 09:34:28,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 09:34:28,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 09:34:28,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 09:34:28,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 09:34:28,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 09:34:28,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 09:34:28,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 09:34:28,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 09:34:28,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 09:34:28,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 09:34:28,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 09:34:28,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 09:34:28,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 09:34:28,222 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 09:34:28,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 09:34:28,222 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 09:34:28,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 09:34:28,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 09:34:28,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 09:34:28,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 09:34:28,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 09:34:28,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 09:34:28,223 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 09:34:28,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 09:34:28,223 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 09:34:28,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 09:34:28,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 09:34:28,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 09:34:28,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 09:34:28,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 09:34:28,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 09:34:28,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 09:34:28,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 09:34:28,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 09:34:28,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 09:34:28,225 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 09:34:28,225 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 09:34:28,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 09:34:28,225 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 -> 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 [2022-07-19 09:34:28,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 09:34:28,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 09:34:28,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 09:34:28,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 09:34:28,457 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 09:34:28,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr5.c [2022-07-19 09:34:28,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9f26f03/89c3b9573deb452cb870008e2d2db750/FLAGc0c41c2f9 [2022-07-19 09:34:28,907 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 09:34:28,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr5.c [2022-07-19 09:34:28,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9f26f03/89c3b9573deb452cb870008e2d2db750/FLAGc0c41c2f9 [2022-07-19 09:34:28,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9f26f03/89c3b9573deb452cb870008e2d2db750 [2022-07-19 09:34:28,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 09:34:28,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 09:34:28,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 09:34:28,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 09:34:28,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 09:34:28,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:34:28" (1/1) ... [2022-07-19 09:34:28,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4056775a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:28, skipping insertion in model container [2022-07-19 09:34:28,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:34:28" (1/1) ... [2022-07-19 09:34:28,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 09:34:28,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 09:34:29,086 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-tiling/nr5.c[394,407] [2022-07-19 09:34:29,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 09:34:29,101 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 09:34:29,108 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-tiling/nr5.c[394,407] [2022-07-19 09:34:29,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 09:34:29,121 INFO L208 MainTranslator]: Completed translation [2022-07-19 09:34:29,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29 WrapperNode [2022-07-19 09:34:29,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 09:34:29,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 09:34:29,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 09:34:29,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 09:34:29,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,142 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2022-07-19 09:34:29,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 09:34:29,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 09:34:29,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 09:34:29,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 09:34:29,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 09:34:29,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 09:34:29,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 09:34:29,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 09:34:29,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (1/1) ... [2022-07-19 09:34:29,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 09:34:29,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:29,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 09:34:29,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 09:34:29,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 09:34:29,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 09:34:29,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 09:34:29,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 09:34:29,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 09:34:29,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 09:34:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 09:34:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 09:34:29,288 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 09:34:29,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 09:34:29,394 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 09:34:29,398 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 09:34:29,398 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 09:34:29,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:34:29 BoogieIcfgContainer [2022-07-19 09:34:29,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 09:34:29,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 09:34:29,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 09:34:29,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 09:34:29,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:34:28" (1/3) ... [2022-07-19 09:34:29,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0bc5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:34:29, skipping insertion in model container [2022-07-19 09:34:29,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:29" (2/3) ... [2022-07-19 09:34:29,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0bc5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:34:29, skipping insertion in model container [2022-07-19 09:34:29,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:34:29" (3/3) ... [2022-07-19 09:34:29,405 INFO L111 eAbstractionObserver]: Analyzing ICFG nr5.c [2022-07-19 09:34:29,414 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 09:34:29,414 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 09:34:29,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 09:34:29,448 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48575bff, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f1ea00a [2022-07-19 09:34:29,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 09:34:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 09:34:29,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:29,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:29,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-19 09:34:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:29,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571671971] [2022-07-19 09:34:29,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:29,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:29,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571671971] [2022-07-19 09:34:29,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571671971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 09:34:29,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 09:34:29,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 09:34:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80562761] [2022-07-19 09:34:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 09:34:29,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 09:34:29,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:29,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 09:34:29,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 09:34:29,592 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:29,616 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-19 09:34:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 09:34:29,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 09:34:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:29,622 INFO L225 Difference]: With dead ends: 45 [2022-07-19 09:34:29,622 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 09:34:29,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 09:34:29,631 INFO L413 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:29,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 09:34:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-19 09:34:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-19 09:34:29,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-19 09:34:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:29,657 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-19 09:34:29,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-19 09:34:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 09:34:29,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:29,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:29,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 09:34:29,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-19 09:34:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:29,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303044494] [2022-07-19 09:34:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:29,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:29,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303044494] [2022-07-19 09:34:29,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303044494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 09:34:29,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 09:34:29,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 09:34:29,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303041727] [2022-07-19 09:34:29,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 09:34:29,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 09:34:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:29,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 09:34:29,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 09:34:29,780 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:29,830 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-19 09:34:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 09:34:29,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 09:34:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:29,831 INFO L225 Difference]: With dead ends: 29 [2022-07-19 09:34:29,831 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 09:34:29,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 09:34:29,832 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:29,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 09:34:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-19 09:34:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-19 09:34:29,836 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-19 09:34:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:29,836 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-19 09:34:29,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-19 09:34:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 09:34:29,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:29,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:29,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 09:34:29,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:29,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-19 09:34:29,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:29,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450911731] [2022-07-19 09:34:29,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:30,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:30,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450911731] [2022-07-19 09:34:30,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450911731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 09:34:30,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 09:34:30,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 09:34:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46998856] [2022-07-19 09:34:30,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 09:34:30,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 09:34:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:30,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 09:34:30,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 09:34:30,009 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:30,052 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-19 09:34:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 09:34:30,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 09:34:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:30,054 INFO L225 Difference]: With dead ends: 38 [2022-07-19 09:34:30,054 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 09:34:30,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 09:34:30,055 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:30,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 09:34:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-19 09:34:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-19 09:34:30,060 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-19 09:34:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:30,060 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-19 09:34:30,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-19 09:34:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 09:34:30,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:30,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:30,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 09:34:30,062 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-19 09:34:30,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:30,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106466511] [2022-07-19 09:34:30,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:30,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106466511] [2022-07-19 09:34:30,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106466511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 09:34:30,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 09:34:30,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 09:34:30,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056530183] [2022-07-19 09:34:30,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 09:34:30,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 09:34:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:30,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 09:34:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 09:34:30,132 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:30,152 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-19 09:34:30,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 09:34:30,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 09:34:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:30,155 INFO L225 Difference]: With dead ends: 42 [2022-07-19 09:34:30,155 INFO L226 Difference]: Without dead ends: 26 [2022-07-19 09:34:30,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 09:34:30,156 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:30,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-19 09:34:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-19 09:34:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-19 09:34:30,161 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-19 09:34:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:30,162 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-19 09:34:30,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-19 09:34:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 09:34:30,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:30,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:30,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 09:34:30,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:30,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-19 09:34:30,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:30,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839260176] [2022-07-19 09:34:30,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:30,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:30,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:30,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839260176] [2022-07-19 09:34:30,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839260176] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:30,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411943631] [2022-07-19 09:34:30,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:30,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:30,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:30,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:30,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 09:34:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:30,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 09:34:30,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:30,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:34:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:30,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411943631] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:34:30,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:34:30,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-19 09:34:30,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168460491] [2022-07-19 09:34:30,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:34:30,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 09:34:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:30,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 09:34:30,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-19 09:34:30,315 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:30,342 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-07-19 09:34:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 09:34:30,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-19 09:34:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:30,343 INFO L225 Difference]: With dead ends: 50 [2022-07-19 09:34:30,343 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 09:34:30,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-19 09:34:30,345 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:30,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 68 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 09:34:30,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-19 09:34:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-19 09:34:30,349 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 19 [2022-07-19 09:34:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:30,350 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-19 09:34:30,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-07-19 09:34:30,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 09:34:30,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:30,351 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:30,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 09:34:30,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:30,586 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2124634745, now seen corresponding path program 2 times [2022-07-19 09:34:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:30,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872710298] [2022-07-19 09:34:30,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:30,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:30,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:30,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872710298] [2022-07-19 09:34:30,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872710298] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020601011] [2022-07-19 09:34:30,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 09:34:30,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:30,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:30,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:30,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 09:34:30,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 09:34:30,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:34:30,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 09:34:30,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:30,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:34:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:30,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020601011] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:34:30,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:34:30,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-19 09:34:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593326503] [2022-07-19 09:34:30,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:34:30,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 09:34:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 09:34:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-19 09:34:30,764 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:30,796 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-07-19 09:34:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 09:34:30,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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 28 [2022-07-19 09:34:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:30,797 INFO L225 Difference]: With dead ends: 62 [2022-07-19 09:34:30,797 INFO L226 Difference]: Without dead ends: 36 [2022-07-19 09:34:30,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-19 09:34:30,798 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:30,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-19 09:34:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-19 09:34:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-19 09:34:30,802 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2022-07-19 09:34:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:30,802 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-19 09:34:30,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-19 09:34:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 09:34:30,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:30,804 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:30,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 09:34:31,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-19 09:34:31,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash -233654912, now seen corresponding path program 3 times [2022-07-19 09:34:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:31,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497067429] [2022-07-19 09:34:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:31,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:31,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497067429] [2022-07-19 09:34:31,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497067429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:31,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276457914] [2022-07-19 09:34:31,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 09:34:31,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:31,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:31,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:31,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 09:34:31,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 09:34:31,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:34:31,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 09:34:31,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 09:34:31,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:34:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 09:34:31,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276457914] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:34:31,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:34:31,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-07-19 09:34:31,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982986293] [2022-07-19 09:34:31,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:34:31,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 09:34:31,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 09:34:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-19 09:34:31,233 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:31,307 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-07-19 09:34:31,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 09:34:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-19 09:34:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:31,308 INFO L225 Difference]: With dead ends: 70 [2022-07-19 09:34:31,308 INFO L226 Difference]: Without dead ends: 41 [2022-07-19 09:34:31,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-07-19 09:34:31,309 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:31,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 59 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-19 09:34:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-07-19 09:34:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-07-19 09:34:31,314 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 31 [2022-07-19 09:34:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:31,314 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-07-19 09:34:31,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-07-19 09:34:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 09:34:31,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:31,315 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:31,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 09:34:31,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:31,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash 467409666, now seen corresponding path program 1 times [2022-07-19 09:34:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:31,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347585192] [2022-07-19 09:34:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:31,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:32,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347585192] [2022-07-19 09:34:32,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347585192] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:32,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337564047] [2022-07-19 09:34:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:32,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:32,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:32,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:32,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 09:34:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:32,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 09:34:32,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:32,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-19 09:34:32,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:34:32,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:34:32,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:34:32,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:34:32,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:34:32,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:34:32,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:34:32,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-19 09:34:32,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 09:34:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:32,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:35:01,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))))) is different from false [2022-07-19 09:35:14,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse0) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) is different from false [2022-07-19 09:35:26,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_38| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_38| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (|v_ULTIMATE.start_main_~j~0#1_37| Int) (v_ArrVal_88 Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |v_ULTIMATE.start_main_~j~0#1_38|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_38| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_88) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse0) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) is different from false [2022-07-19 09:35:26,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2022-07-19 09:35:26,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3440 treesize of output 3432 [2022-07-19 09:35:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-19 09:35:29,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337564047] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:35:29,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:35:29,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 16] total 40 [2022-07-19 09:35:29,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456441717] [2022-07-19 09:35:29,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:35:29,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 09:35:29,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:35:29,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 09:35:29,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1078, Unknown=25, NotChecked=216, Total=1560 [2022-07-19 09:35:29,740 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:35:31,773 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 20 |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) .cse2))) (and (<= |c_ULTIMATE.start_main_~j~0#1| .cse0) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((|v_ULTIMATE.start_main_~j~0#1_38| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_38| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (|v_ULTIMATE.start_main_~j~0#1_37| Int) (v_ArrVal_88 Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |v_ULTIMATE.start_main_~j~0#1_38|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_38| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_88) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse1) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (= .cse2 0) (= .cse0 5) (= |c_ULTIMATE.start_main_~j~0#1| 5) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-19 09:35:33,845 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse2 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 (select .cse0 0)) (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse1) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (<= |c_ULTIMATE.start_main_~j~0#1| 4) (<= 5 (select .cse0 (+ (- 20) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 1) (div (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) 4)) (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))))) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-19 09:35:35,891 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 (select .cse0 0)) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2) (div (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse2 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse2) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (<= 5 (select .cse0 (+ (- 20) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~j~0#1| 3) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))))) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-19 09:35:37,978 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 (select .cse0 0)) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2) (div (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse2 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse2) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (<= 5 (select .cse0 (+ (- 20) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~j~0#1| 2) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))))) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-19 09:35:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:35:38,409 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-07-19 09:35:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 09:35:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-19 09:35:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:35:38,411 INFO L225 Difference]: With dead ends: 119 [2022-07-19 09:35:38,411 INFO L226 Difference]: Without dead ends: 109 [2022-07-19 09:35:38,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 64.9s TimeCoverageRelationStatistics Valid=589, Invalid=2380, Unknown=29, NotChecked=784, Total=3782 [2022-07-19 09:35:38,413 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 145 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 09:35:38,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 183 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 417 Invalid, 0 Unknown, 285 Unchecked, 0.2s Time] [2022-07-19 09:35:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-19 09:35:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2022-07-19 09:35:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:35:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-07-19 09:35:38,425 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 31 [2022-07-19 09:35:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:35:38,426 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-07-19 09:35:38,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:35:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-07-19 09:35:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 09:35:38,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:35:38,429 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:35:38,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 09:35:38,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:35:38,630 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:35:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:35:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash 594002453, now seen corresponding path program 1 times [2022-07-19 09:35:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:35:38,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438666494] [2022-07-19 09:35:38,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:35:38,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:35:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:35:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:35:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:35:39,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438666494] [2022-07-19 09:35:39,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438666494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:35:39,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403119558] [2022-07-19 09:35:39,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:35:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:35:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:35:39,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:35:39,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 09:35:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:35:39,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 09:35:39,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:35:39,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-19 09:35:39,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:35:39,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:35:39,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:35:39,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:35:39,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:35:39,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-19 09:35:39,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 09:35:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:35:39,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:36:06,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-19 09:36:19,370 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4)) .cse0) v_ArrVal_121) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-19 09:36:19,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2022-07-19 09:36:19,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1972 treesize of output 1956 [2022-07-19 09:36:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 29 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-19 09:36:21,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403119558] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:36:21,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:36:21,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 41 [2022-07-19 09:36:21,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820259670] [2022-07-19 09:36:21,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:36:21,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 09:36:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:36:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 09:36:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1218, Unknown=24, NotChecked=150, Total=1640 [2022-07-19 09:36:21,955 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:36:24,008 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4)) .cse0) v_ArrVal_121) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~j~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) .cse1)) |c_ULTIMATE.start_main_~j~0#1|) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (< (+ 3 (* |c_ULTIMATE.start_main_~j~0#1| 4)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0))) is different from false [2022-07-19 09:36:26,028 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~j~0#1| 3) (<= 4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)) is different from false [2022-07-19 09:36:28,125 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (<= 4 (select .cse0 (+ (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 20 |c_ULTIMATE.start_main_~i~0#1|)))) (forall ((|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse1) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse1) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~j~0#1| 2) (<= |c_ULTIMATE.start_main_~j~0#1| 3) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 4 (select .cse0 4)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-19 09:36:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:36:28,792 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2022-07-19 09:36:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-19 09:36:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 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) Word has length 37 [2022-07-19 09:36:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:36:28,793 INFO L225 Difference]: With dead ends: 129 [2022-07-19 09:36:28,794 INFO L226 Difference]: Without dead ends: 119 [2022-07-19 09:36:28,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=591, Invalid=2942, Unknown=27, NotChecked=600, Total=4160 [2022-07-19 09:36:28,795 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 333 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 09:36:28,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 205 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 468 Invalid, 0 Unknown, 218 Unchecked, 0.2s Time] [2022-07-19 09:36:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-19 09:36:28,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 79. [2022-07-19 09:36:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:36:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-07-19 09:36:28,802 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 37 [2022-07-19 09:36:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:36:28,802 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-07-19 09:36:28,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:36:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-07-19 09:36:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 09:36:28,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:36:28,803 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:36:28,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 09:36:29,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:36:29,004 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:36:29,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:36:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash 879791848, now seen corresponding path program 2 times [2022-07-19 09:36:29,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:36:29,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664483147] [2022-07-19 09:36:29,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:36:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:36:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:36:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:36:29,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:36:29,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664483147] [2022-07-19 09:36:29,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664483147] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:36:29,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069033478] [2022-07-19 09:36:29,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 09:36:29,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:36:29,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:36:29,317 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:36:29,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 09:36:29,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 09:36:29,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:36:29,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 09:36:29,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:36:29,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-19 09:36:29,580 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-19 09:36:29,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:36:29,635 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-19 09:36:29,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-07-19 09:36:29,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 09:36:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:36:29,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:36:54,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~j~0#1_57| Int) (v_ArrVal_153 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) .cse0) v_ArrVal_153) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_156)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_57| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-19 09:36:56,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_58| Int)) (or (forall ((v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~j~0#1_57| Int) (v_ArrVal_153 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_57| 1) |v_ULTIMATE.start_main_~j~0#1_58|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_58| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_153) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_156)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_58| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-19 09:36:56,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-07-19 09:36:56,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 220 [2022-07-19 09:36:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-19 09:36:58,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069033478] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:36:58,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:36:58,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 16] total 45 [2022-07-19 09:36:58,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448009774] [2022-07-19 09:36:58,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:36:58,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-19 09:36:58,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:36:58,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-19 09:36:58,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1544, Unknown=14, NotChecked=166, Total=1980 [2022-07-19 09:36:58,201 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:00,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse2 (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0)) (.cse1 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))) (and (<= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 20 |c_ULTIMATE.start_main_~i~0#1|)))) (<= 3 |c_ULTIMATE.start_main_~j~0#1|) (or (and (<= 3 .cse1) .cse2) (= .cse1 0)) .cse2 (<= |c_ULTIMATE.start_main_~j~0#1| 3) (forall ((|v_ULTIMATE.start_main_~j~0#1_58| Int)) (or (forall ((v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~j~0#1_57| Int) (v_ArrVal_153 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_57| 1) |v_ULTIMATE.start_main_~j~0#1_58|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_58| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_153) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_156)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_58| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)))) is different from false [2022-07-19 09:37:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:37:05,392 INFO L93 Difference]: Finished difference Result 231 states and 264 transitions. [2022-07-19 09:37:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-19 09:37:05,393 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-19 09:37:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:37:05,394 INFO L225 Difference]: With dead ends: 231 [2022-07-19 09:37:05,394 INFO L226 Difference]: Without dead ends: 170 [2022-07-19 09:37:05,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=712, Invalid=4686, Unknown=16, NotChecked=438, Total=5852 [2022-07-19 09:37:05,396 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 243 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 09:37:05,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 359 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 721 Invalid, 0 Unknown, 161 Unchecked, 0.4s Time] [2022-07-19 09:37:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-19 09:37:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 104. [2022-07-19 09:37:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.1553398058252426) internal successors, (119), 103 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-07-19 09:37:05,419 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 43 [2022-07-19 09:37:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:37:05,421 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-07-19 09:37:05,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-07-19 09:37:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 09:37:05,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:37:05,426 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:37:05,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 09:37:05,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:37:05,636 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:37:05,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:37:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash 941831462, now seen corresponding path program 3 times [2022-07-19 09:37:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:37:05,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153931502] [2022-07-19 09:37:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:37:05,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:37:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:37:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 09:37:05,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:37:05,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153931502] [2022-07-19 09:37:05,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153931502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:37:05,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079141503] [2022-07-19 09:37:05,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 09:37:05,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:37:05,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:37:05,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:37:05,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 09:37:05,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-19 09:37:05,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:37:05,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 09:37:05,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:37:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 09:37:05,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:37:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 09:37:05,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079141503] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:37:05,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:37:05,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-19 09:37:05,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331784070] [2022-07-19 09:37:05,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:37:05,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 09:37:05,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:37:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 09:37:05,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-19 09:37:05,833 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:37:05,893 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-07-19 09:37:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 09:37:05,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 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 43 [2022-07-19 09:37:05,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:37:05,894 INFO L225 Difference]: With dead ends: 151 [2022-07-19 09:37:05,894 INFO L226 Difference]: Without dead ends: 79 [2022-07-19 09:37:05,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-19 09:37:05,897 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:37:05,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 55 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:37:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-19 09:37:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-19 09:37:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-07-19 09:37:05,912 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 43 [2022-07-19 09:37:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:37:05,912 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-07-19 09:37:05,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-07-19 09:37:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 09:37:05,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:37:05,914 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:37:05,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 09:37:06,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:37:06,115 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:37:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:37:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1886597499, now seen corresponding path program 4 times [2022-07-19 09:37:06,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:37:06,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249984181] [2022-07-19 09:37:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:37:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:37:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:37:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:37:06,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:37:06,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249984181] [2022-07-19 09:37:06,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249984181] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:37:06,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168853604] [2022-07-19 09:37:06,474 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 09:37:06,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:37:06,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:37:06,476 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:37:06,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 09:37:06,538 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 09:37:06,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:37:06,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 09:37:06,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:37:06,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-19 09:37:06,717 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-19 09:37:06,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-07-19 09:37:06,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 09:37:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:37:06,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:37:25,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-19 09:37:25,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2022-07-19 09:37:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:37:25,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168853604] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:37:25,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:37:25,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2022-07-19 09:37:25,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346031888] [2022-07-19 09:37:25,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:37:25,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 09:37:25,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:37:25,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 09:37:25,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1418, Unknown=8, NotChecked=0, Total=1640 [2022-07-19 09:37:25,245 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:37:26,084 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2022-07-19 09:37:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-19 09:37:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-19 09:37:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:37:26,097 INFO L225 Difference]: With dead ends: 197 [2022-07-19 09:37:26,097 INFO L226 Difference]: Without dead ends: 187 [2022-07-19 09:37:26,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=498, Invalid=3154, Unknown=8, NotChecked=0, Total=3660 [2022-07-19 09:37:26,098 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 227 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 09:37:26,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 442 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 800 Invalid, 0 Unknown, 363 Unchecked, 0.4s Time] [2022-07-19 09:37:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-19 09:37:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 140. [2022-07-19 09:37:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.1007194244604317) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2022-07-19 09:37:26,123 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 49 [2022-07-19 09:37:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:37:26,123 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-07-19 09:37:26,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2022-07-19 09:37:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 09:37:26,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:37:26,125 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:37:26,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 09:37:26,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 09:37:26,325 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:37:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:37:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash -185464757, now seen corresponding path program 2 times [2022-07-19 09:37:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:37:26,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603356389] [2022-07-19 09:37:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:37:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:37:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:37:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 7 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:37:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:37:26,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603356389] [2022-07-19 09:37:26,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603356389] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:37:26,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313245689] [2022-07-19 09:37:26,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 09:37:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:37:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:37:26,937 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:37:26,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 09:37:26,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 09:37:27,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:37:27,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-19 09:37:27,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:37:27,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-19 09:37:27,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:27,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:37:27,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:27,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:37:27,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:27,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:37:27,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:27,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 09:37:27,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:27,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-19 09:37:27,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:27,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-19 09:37:27,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:27,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-19 09:37:27,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:27,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-19 09:37:27,607 INFO L356 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2022-07-19 09:37:27,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 33 [2022-07-19 09:37:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 22 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:37:27,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:38:16,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_92| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_92| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_267 Int) (|v_ULTIMATE.start_main_~j~0#1_91| Int) (v_ArrVal_270 Int)) (let ((.cse0 (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_92| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_267) (+ (* |v_ULTIMATE.start_main_~j~0#1_91| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_270)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_91| 1) |v_ULTIMATE.start_main_~j~0#1_92|))))))) is different from false [2022-07-19 09:39:03,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_93| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_93| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_267 Int) (|v_ULTIMATE.start_main_~j~0#1_91| Int) (|v_ULTIMATE.start_main_~j~0#1_92| Int) (v_ArrVal_265 Int) (v_ArrVal_270 Int)) (let ((.cse0 (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_93| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_265) (+ (* |v_ULTIMATE.start_main_~j~0#1_92| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_267) (+ (* |v_ULTIMATE.start_main_~j~0#1_91| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_270)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_92| 1) |v_ULTIMATE.start_main_~j~0#1_93|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_91| 1) |v_ULTIMATE.start_main_~j~0#1_92|)) (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))))) is different from false