./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condg.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/condg.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 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:48:05,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:48:05,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:48:05,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:48:05,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:48:05,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:48:05,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:48:05,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:48:05,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:48:05,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:48:05,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:48:05,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:48:05,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:48:05,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:48:05,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:48:05,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:48:05,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:48:05,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:48:05,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:48:05,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:48:05,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:48:05,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:48:05,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:48:05,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:48:05,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:48:05,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:48:05,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:48:05,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:48:05,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:48:05,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:48:05,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:48:05,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:48:05,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:48:05,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:48:05,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:48:05,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:48:05,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:48:05,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:48:05,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:48:05,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:48:05,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:48:05,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 08:48:05,269 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:48:05,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:48:05,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:48:05,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:48:05,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:48:05,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:48:05,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:48:05,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:48:05,275 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:48:05,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:48:05,276 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:48:05,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 08:48:05,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:48:05,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:48:05,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:48:05,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:48:05,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:48:05,277 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:48:05,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:48:05,277 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:48:05,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:48:05,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:48:05,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:48:05,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:48:05,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:48:05,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:48:05,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:48:05,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:48:05,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 08:48:05,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 08:48:05,278 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:48:05,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:48:05,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:48:05,279 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:48:05,279 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 -> 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 [2021-12-15 08:48:05,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:48:05,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:48:05,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:48:05,497 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:48:05,497 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:48:05,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condg.c [2021-12-15 08:48:05,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aefd6d76/ad6f38e36c574fe9944667fe8177b2a0/FLAG559edad04 [2021-12-15 08:48:05,951 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:48:05,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c [2021-12-15 08:48:05,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aefd6d76/ad6f38e36c574fe9944667fe8177b2a0/FLAG559edad04 [2021-12-15 08:48:05,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aefd6d76/ad6f38e36c574fe9944667fe8177b2a0 [2021-12-15 08:48:05,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:48:05,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:48:05,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:48:05,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:48:05,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:48:05,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:48:05" (1/1) ... [2021-12-15 08:48:05,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcbd3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:05, skipping insertion in model container [2021-12-15 08:48:05,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:48:05" (1/1) ... [2021-12-15 08:48:05,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:48:06,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:48:06,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] [2021-12-15 08:48:06,164 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:48:06,170 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:48:06,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] [2021-12-15 08:48:06,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:48:06,209 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:48:06,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06 WrapperNode [2021-12-15 08:48:06,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:48:06,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:48:06,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:48:06,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:48:06,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,247 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2021-12-15 08:48:06,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:48:06,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:48:06,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:48:06,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:48:06,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:48:06,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:48:06,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:48:06,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:48:06,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (1/1) ... [2021-12-15 08:48:06,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:48:06,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:06,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 08:48:06,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 08:48:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:48:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 08:48:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 08:48:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 08:48:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 08:48:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:48:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:48:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 08:48:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 08:48:06,411 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:48:06,412 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:48:06,587 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:48:06,591 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:48:06,591 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-15 08:48:06,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:48:06 BoogieIcfgContainer [2021-12-15 08:48:06,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:48:06,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:48:06,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:48:06,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:48:06,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:48:05" (1/3) ... [2021-12-15 08:48:06,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792846af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:48:06, skipping insertion in model container [2021-12-15 08:48:06,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:48:06" (2/3) ... [2021-12-15 08:48:06,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792846af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:48:06, skipping insertion in model container [2021-12-15 08:48:06,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:48:06" (3/3) ... [2021-12-15 08:48:06,604 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2021-12-15 08:48:06,609 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:48:06,609 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:48:06,649 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:48:06,655 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 08:48:06,656 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:48:06,671 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) [2021-12-15 08:48:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 08:48:06,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:06,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:06,676 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2021-12-15 08:48:06,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:06,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209013528] [2021-12-15 08:48:06,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:06,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:06,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:06,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209013528] [2021-12-15 08:48:06,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209013528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:48:06,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:48:06,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 08:48:06,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935933207] [2021-12-15 08:48:06,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:48:06,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 08:48:06,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:06,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 08:48:06,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:48:06,843 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:06,855 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2021-12-15 08:48:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 08:48:06,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-15 08:48:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:06,862 INFO L225 Difference]: With dead ends: 46 [2021-12-15 08:48:06,863 INFO L226 Difference]: Without dead ends: 21 [2021-12-15 08:48:06,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:48:06,868 INFO L933 BasicCegarLoop]: 30 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, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:06,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:48:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-15 08:48:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-15 08:48:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-15 08:48:06,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2021-12-15 08:48:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:06,896 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-15 08:48:06,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-12-15 08:48:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 08:48:06,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:06,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:06,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 08:48:06,899 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2021-12-15 08:48:06,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:06,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408545214] [2021-12-15 08:48:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:06,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:06,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:06,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408545214] [2021-12-15 08:48:06,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408545214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:48:06,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:48:06,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:48:06,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336540194] [2021-12-15 08:48:06,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:48:06,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:48:06,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:06,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:48:06,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:48:06,983 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:07,044 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-12-15 08:48:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:48:07,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-15 08:48:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:07,046 INFO L225 Difference]: With dead ends: 48 [2021-12-15 08:48:07,046 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 08:48:07,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:48:07,051 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:07,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:48:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 08:48:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2021-12-15 08:48:07,058 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) [2021-12-15 08:48:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-15 08:48:07,059 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2021-12-15 08:48:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:07,061 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-15 08:48:07,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-15 08:48:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 08:48:07,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:07,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:07,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 08:48:07,065 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:07,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2021-12-15 08:48:07,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:07,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028002379] [2021-12-15 08:48:07,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:07,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:07,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:07,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028002379] [2021-12-15 08:48:07,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028002379] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493921571] [2021-12-15 08:48:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:07,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:07,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:07,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:07,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 08:48:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:07,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 08:48:07,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:07,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 08:48:07,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:48:07,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:48:07,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-15 08:48:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:07,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:07,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_45 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_45) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2021-12-15 08:48:07,803 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:48:07,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-15 08:48:07,810 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:48:07,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2021-12-15 08:48:07,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-15 08:48:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 08:48:07,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493921571] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:07,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:07,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2021-12-15 08:48:07,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769405241] [2021-12-15 08:48:07,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:07,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 08:48:07,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:07,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 08:48:07,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2021-12-15 08:48:07,849 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) [2021-12-15 08:48:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:08,058 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2021-12-15 08:48:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 08:48:08,059 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 21 [2021-12-15 08:48:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:08,061 INFO L225 Difference]: With dead ends: 56 [2021-12-15 08:48:08,061 INFO L226 Difference]: Without dead ends: 54 [2021-12-15 08:48:08,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2021-12-15 08:48:08,064 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:08,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 158 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2021-12-15 08:48:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-15 08:48:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2021-12-15 08:48:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-15 08:48:08,072 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2021-12-15 08:48:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:08,074 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-15 08:48:08,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) [2021-12-15 08:48:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-15 08:48:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 08:48:08,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:08,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:08,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 08:48:08,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:08,284 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2021-12-15 08:48:08,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:08,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407535889] [2021-12-15 08:48:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:08,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:08,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:08,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407535889] [2021-12-15 08:48:08,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407535889] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:08,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036762398] [2021-12-15 08:48:08,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:08,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:08,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:08,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:08,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 08:48:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:08,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 08:48:08,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:08,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:48:08,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 08:48:08,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:48:08,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-12-15 08:48:08,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-12-15 08:48:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:08,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:09,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:48:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:09,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036762398] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:09,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:09,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2021-12-15 08:48:09,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967693400] [2021-12-15 08:48:09,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:09,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-15 08:48:09,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:09,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-15 08:48:09,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-12-15 08:48:09,079 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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) [2021-12-15 08:48:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:09,284 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2021-12-15 08:48:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 08:48:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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 21 [2021-12-15 08:48:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:09,287 INFO L225 Difference]: With dead ends: 66 [2021-12-15 08:48:09,287 INFO L226 Difference]: Without dead ends: 56 [2021-12-15 08:48:09,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2021-12-15 08:48:09,291 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:09,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2021-12-15 08:48:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-15 08:48:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2021-12-15 08:48:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2021-12-15 08:48:09,304 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21 [2021-12-15 08:48:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:09,304 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2021-12-15 08:48:09,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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) [2021-12-15 08:48:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2021-12-15 08:48:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 08:48:09,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:09,306 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:09,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 08:48:09,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-15 08:48:09,520 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:09,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1912499326, now seen corresponding path program 2 times [2021-12-15 08:48:09,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:09,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775147119] [2021-12-15 08:48:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:09,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:48:09,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:09,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775147119] [2021-12-15 08:48:09,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775147119] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:09,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564957217] [2021-12-15 08:48:09,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:48:09,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:09,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:09,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:09,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 08:48:09,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:48:09,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:48:09,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:48:09,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:48:09,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:48:09,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564957217] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:09,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:09,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-12-15 08:48:09,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784118286] [2021-12-15 08:48:09,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:09,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 08:48:09,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 08:48:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-15 08:48:09,731 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:09,915 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2021-12-15 08:48:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 08:48:09,916 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 08:48:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:09,916 INFO L225 Difference]: With dead ends: 93 [2021-12-15 08:48:09,917 INFO L226 Difference]: Without dead ends: 55 [2021-12-15 08:48:09,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2021-12-15 08:48:09,918 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 161 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:09,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 82 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:48:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-15 08:48:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2021-12-15 08:48:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-12-15 08:48:09,921 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2021-12-15 08:48:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:09,922 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-15 08:48:09,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2021-12-15 08:48:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 08:48:09,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:09,923 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:09,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 08:48:10,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:10,140 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:10,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 1 times [2021-12-15 08:48:10,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:10,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721146440] [2021-12-15 08:48:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:10,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-15 08:48:10,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:10,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721146440] [2021-12-15 08:48:10,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721146440] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:10,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547755691] [2021-12-15 08:48:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:10,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:10,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:10,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:10,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 08:48:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:10,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 08:48:10,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:10,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:48:10,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:10,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-15 08:48:10,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-15 08:48:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:48:10,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:10,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_152 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-15 08:48:10,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_152 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-15 08:48:10,380 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:48:10,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-15 08:48:10,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-15 08:48:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2021-12-15 08:48:10,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547755691] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:10,400 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:10,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2021-12-15 08:48:10,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862393738] [2021-12-15 08:48:10,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:10,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 08:48:10,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:10,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 08:48:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2021-12-15 08:48:10,402 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:10,501 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2021-12-15 08:48:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 08:48:10,502 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 08:48:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:10,502 INFO L225 Difference]: With dead ends: 76 [2021-12-15 08:48:10,502 INFO L226 Difference]: Without dead ends: 66 [2021-12-15 08:48:10,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=108, Unknown=2, NotChecked=46, Total=210 [2021-12-15 08:48:10,503 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:10,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 83 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 107 Invalid, 0 Unknown, 94 Unchecked, 0.0s Time] [2021-12-15 08:48:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-15 08:48:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2021-12-15 08:48:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-12-15 08:48:10,506 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 28 [2021-12-15 08:48:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:10,507 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-12-15 08:48:10,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-12-15 08:48:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 08:48:10,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:10,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:10,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 08:48:10,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:10,719 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2021-12-15 08:48:10,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:10,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592434867] [2021-12-15 08:48:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:10,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 08:48:11,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:11,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592434867] [2021-12-15 08:48:11,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592434867] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:11,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594119025] [2021-12-15 08:48:11,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:48:11,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:11,460 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:11,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 08:48:11,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 08:48:11,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:48:11,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-15 08:48:11,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:11,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:48:11,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:11,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:48:11,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:11,649 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 08:48:11,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-15 08:48:11,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:11,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:48:11,854 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:48:11,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 41 [2021-12-15 08:48:11,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:11,978 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-15 08:48:11,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 44 [2021-12-15 08:48:12,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:12,337 INFO L354 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2021-12-15 08:48:12,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2021-12-15 08:48:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:12,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:14,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (let ((.cse1 (<= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse0 (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))) .cse6)))))) (.cse2 (<= |v_ULTIMATE.start_main_~i~0#1_69| 0))) (and (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_69| 1) .cse0) .cse1 .cse2) (or .cse1 (<= .cse0 2) .cse2))) (< 1 |v_ULTIMATE.start_main_~i~0#1_69|))) is different from false [2021-12-15 08:48:31,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (let ((.cse1 (let ((.cse7 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 4)) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))) .cse6)))))) (.cse0 (<= |v_ULTIMATE.start_main_~i~0#1_72| 0)) (.cse2 (<= |v_ULTIMATE.start_main_~i~0#1_69| 0))) (and (or .cse0 (<= .cse1 2) .cse2) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_69| 1) .cse1) .cse0 .cse2))) (< 1 |v_ULTIMATE.start_main_~i~0#1_69|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|))) is different from false [2021-12-15 08:48:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-15 08:48:31,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594119025] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:31,286 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:31,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2021-12-15 08:48:31,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426874043] [2021-12-15 08:48:31,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:31,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-15 08:48:31,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-15 08:48:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1786, Unknown=11, NotChecked=178, Total=2256 [2021-12-15 08:48:31,289 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 48 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:38,507 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2021-12-15 08:48:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-15 08:48:38,508 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 08:48:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:38,509 INFO L225 Difference]: With dead ends: 90 [2021-12-15 08:48:38,509 INFO L226 Difference]: Without dead ends: 76 [2021-12-15 08:48:38,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=491, Invalid=3281, Unknown=18, NotChecked=242, Total=4032 [2021-12-15 08:48:38,511 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:38,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 132 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 187 Invalid, 0 Unknown, 312 Unchecked, 0.1s Time] [2021-12-15 08:48:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-15 08:48:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2021-12-15 08:48:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2021-12-15 08:48:38,521 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 28 [2021-12-15 08:48:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:38,521 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2021-12-15 08:48:38,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2021-12-15 08:48:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 08:48:38,525 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:38,526 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:38,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 08:48:38,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:38,743 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:38,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1202810022, now seen corresponding path program 4 times [2021-12-15 08:48:38,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:38,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543481650] [2021-12-15 08:48:38,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:38,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:48:38,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:38,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543481650] [2021-12-15 08:48:38,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543481650] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:38,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507202685] [2021-12-15 08:48:38,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 08:48:38,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:38,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:38,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:38,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 08:48:38,836 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 08:48:38,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:48:38,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 08:48:38,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:48:38,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 08:48:38,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507202685] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:38,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:38,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 08:48:38,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590954108] [2021-12-15 08:48:38,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:38,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 08:48:38,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 08:48:38,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 08:48:38,944 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:39,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:39,057 INFO L93 Difference]: Finished difference Result 153 states and 182 transitions. [2021-12-15 08:48:39,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 08:48:39,058 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 30 [2021-12-15 08:48:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:39,058 INFO L225 Difference]: With dead ends: 153 [2021-12-15 08:48:39,058 INFO L226 Difference]: Without dead ends: 120 [2021-12-15 08:48:39,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:48:39,059 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 185 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:39,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 53 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:48:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-15 08:48:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 88. [2021-12-15 08:48:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2021-12-15 08:48:39,068 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 30 [2021-12-15 08:48:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:39,068 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2021-12-15 08:48:39,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2021-12-15 08:48:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 08:48:39,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:39,069 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:39,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 08:48:39,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:39,285 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2021-12-15 08:48:39,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:39,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92454160] [2021-12-15 08:48:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:39,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 08:48:39,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:39,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92454160] [2021-12-15 08:48:39,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92454160] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:39,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346485437] [2021-12-15 08:48:39,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:39,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:39,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:39,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 08:48:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:39,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-15 08:48:39,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:39,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:48:39,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:39,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:48:39,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:39,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:39,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 08:48:39,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:39,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:39,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:48:39,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2021-12-15 08:48:39,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:39,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:39,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2021-12-15 08:48:39,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:39,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:39,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:48:39,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2021-12-15 08:48:40,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:40,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 30 [2021-12-15 08:48:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:40,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2021-12-15 08:48:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:40,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:48:41,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346485437] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:41,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:41,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 43 [2021-12-15 08:48:41,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797872696] [2021-12-15 08:48:41,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:41,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-15 08:48:41,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-15 08:48:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1623, Unknown=0, NotChecked=0, Total=1806 [2021-12-15 08:48:41,712 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:43,285 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2021-12-15 08:48:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-15 08:48:43,285 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 08:48:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:43,285 INFO L225 Difference]: With dead ends: 128 [2021-12-15 08:48:43,285 INFO L226 Difference]: Without dead ends: 109 [2021-12-15 08:48:43,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=434, Invalid=3226, Unknown=0, NotChecked=0, Total=3660 [2021-12-15 08:48:43,287 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:43,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 221 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 145 Invalid, 0 Unknown, 296 Unchecked, 0.1s Time] [2021-12-15 08:48:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-15 08:48:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2021-12-15 08:48:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 101 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2021-12-15 08:48:43,294 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 32 [2021-12-15 08:48:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:43,294 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2021-12-15 08:48:43,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2021-12-15 08:48:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 08:48:43,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:43,294 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:43,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 08:48:43,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:43,507 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:43,507 INFO L85 PathProgramCache]: Analyzing trace with hash -35267436, now seen corresponding path program 1 times [2021-12-15 08:48:43,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:43,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510054754] [2021-12-15 08:48:43,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:43,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-15 08:48:43,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:43,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510054754] [2021-12-15 08:48:43,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510054754] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:43,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292894506] [2021-12-15 08:48:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:43,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:43,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:43,551 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:43,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 08:48:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:43,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 08:48:43,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:43,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:48:43,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:43,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:48:43,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 08:48:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 08:48:43,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:43,724 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_335) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2021-12-15 08:48:43,727 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_335) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-15 08:48:43,737 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:48:43,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-15 08:48:43,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-15 08:48:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2021-12-15 08:48:43,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292894506] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:43,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:43,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2021-12-15 08:48:43,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133868416] [2021-12-15 08:48:43,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:43,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 08:48:43,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 08:48:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2021-12-15 08:48:43,758 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:43,862 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2021-12-15 08:48:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 08:48:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 08:48:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:43,863 INFO L225 Difference]: With dead ends: 144 [2021-12-15 08:48:43,863 INFO L226 Difference]: Without dead ends: 111 [2021-12-15 08:48:43,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=108, Unknown=2, NotChecked=46, Total=210 [2021-12-15 08:48:43,864 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:43,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 72 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 88 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2021-12-15 08:48:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-15 08:48:43,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2021-12-15 08:48:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.160919540229885) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-12-15 08:48:43,870 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 32 [2021-12-15 08:48:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:43,871 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-12-15 08:48:43,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-12-15 08:48:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 08:48:43,871 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:43,872 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:43,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 08:48:44,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-15 08:48:44,083 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash -767176616, now seen corresponding path program 5 times [2021-12-15 08:48:44,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:44,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971617302] [2021-12-15 08:48:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:44,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 08:48:44,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:44,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971617302] [2021-12-15 08:48:44,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971617302] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:44,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180893248] [2021-12-15 08:48:44,127 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 08:48:44,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:44,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:44,128 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:44,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 08:48:44,199 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-15 08:48:44,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:48:44,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 08:48:44,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 08:48:44,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 08:48:44,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180893248] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:44,360 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:44,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 08:48:44,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874064667] [2021-12-15 08:48:44,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:44,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 08:48:44,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:44,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 08:48:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 08:48:44,361 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:48:44,483 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2021-12-15 08:48:44,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 08:48:44,483 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 08:48:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:48:44,484 INFO L225 Difference]: With dead ends: 113 [2021-12-15 08:48:44,484 INFO L226 Difference]: Without dead ends: 85 [2021-12-15 08:48:44,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-15 08:48:44,485 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 131 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:48:44,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 65 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:48:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-15 08:48:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-12-15 08:48:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2021-12-15 08:48:44,488 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 32 [2021-12-15 08:48:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:48:44,488 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2021-12-15 08:48:44,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2021-12-15 08:48:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-15 08:48:44,489 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:48:44,489 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:48:44,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 08:48:44,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:44,699 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:48:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:48:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash -143226682, now seen corresponding path program 2 times [2021-12-15 08:48:44,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:48:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805180789] [2021-12-15 08:48:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:48:44,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:48:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:48:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 08:48:44,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:48:44,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805180789] [2021-12-15 08:48:44,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805180789] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:48:44,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821097969] [2021-12-15 08:48:44,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:48:44,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:48:44,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:48:44,973 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:48:44,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 08:48:45,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:48:45,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:48:45,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-15 08:48:45,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:48:45,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 08:48:45,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 08:48:45,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:45,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:48:45,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:45,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:48:45,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:48:45,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:48:45,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:48:45,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:48:45,233 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:48:45,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2021-12-15 08:48:45,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:45,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:48:45,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:48:45,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:48:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 08:48:45,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:48:47,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (forall ((v_ArrVal_447 Int)) (= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-15 08:48:47,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (= 0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-15 08:48:49,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (= 0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) is different from false [2021-12-15 08:48:51,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (= 0 (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_139| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-15 08:48:52,002 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-15 08:48:52,096 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-15 08:48:52,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-15 08:48:52,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) is different from false [2021-12-15 08:48:52,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_437 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_437) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-15 08:48:52,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_437 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_437) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) is different from false [2021-12-15 08:48:52,440 INFO L354 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2021-12-15 08:48:52,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 73 [2021-12-15 08:48:52,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2021-12-15 08:48:52,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:48:52,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:48:52,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-15 08:48:52,457 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:48:52,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 176 [2021-12-15 08:48:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 25 not checked. [2021-12-15 08:48:52,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821097969] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:48:52,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:48:52,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 36 [2021-12-15 08:48:52,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960177401] [2021-12-15 08:48:52,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:48:52,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-15 08:48:52,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:48:52,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-15 08:48:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=548, Unknown=10, NotChecked=570, Total=1260 [2021-12-15 08:48:52,577 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:48:54,595 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_437 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_437) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-15 08:48:56,608 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= 4 (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-15 08:48:58,714 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (= 0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-15 08:49:00,743 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 0) (<= (+ (div (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (forall ((v_ArrVal_447 Int)) (= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-15 08:49:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:49:00,869 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2021-12-15 08:49:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 08:49:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 0 states have call successors, (0), 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 35 [2021-12-15 08:49:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:49:00,870 INFO L225 Difference]: With dead ends: 66 [2021-12-15 08:49:00,870 INFO L226 Difference]: Without dead ends: 64 [2021-12-15 08:49:00,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 16 SemanticMatches, 43 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=196, Invalid=776, Unknown=14, NotChecked=994, Total=1980 [2021-12-15 08:49:00,871 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:49:00,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 227 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 388 Invalid, 0 Unknown, 462 Unchecked, 0.1s Time] [2021-12-15 08:49:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-15 08:49:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2021-12-15 08:49:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:49:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2021-12-15 08:49:00,875 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 35 [2021-12-15 08:49:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:49:00,875 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2021-12-15 08:49:00,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:49:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2021-12-15 08:49:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-15 08:49:00,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:49:00,876 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:49:00,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 08:49:01,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-15 08:49:01,087 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:49:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:49:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 651947656, now seen corresponding path program 6 times [2021-12-15 08:49:01,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:49:01,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407096778] [2021-12-15 08:49:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:49:01,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:49:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:49:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 08:49:01,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:49:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407096778] [2021-12-15 08:49:01,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407096778] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:49:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237718270] [2021-12-15 08:49:01,965 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 08:49:01,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:49:01,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:49:01,966 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:49:01,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 08:49:02,029 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-15 08:49:02,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:49:02,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-15 08:49:02,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:49:02,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:49:02,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 08:49:02,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 08:49:02,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-15 08:49:02,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2021-12-15 08:49:02,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2021-12-15 08:49:02,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,382 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-12-15 08:49:02,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2021-12-15 08:49:02,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,488 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-12-15 08:49:02,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 69 [2021-12-15 08:49:02,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:49:02,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:49:02,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:49:02,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 19 [2021-12-15 08:49:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 08:49:02,808 INFO L328 TraceCheckSpWp]: Computing backward predicates...