./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ms1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/ms1.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 f19b0f8887e7e48eabb6ce59c44b5494c064f6817a5ff1a77078d9e3a8f8600e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 21:51:29,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 21:51:29,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 21:51:29,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 21:51:29,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 21:51:29,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 21:51:29,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 21:51:29,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 21:51:29,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 21:51:29,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 21:51:29,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 21:51:29,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 21:51:29,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 21:51:29,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 21:51:29,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 21:51:29,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 21:51:29,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 21:51:29,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 21:51:29,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 21:51:29,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 21:51:29,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 21:51:29,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 21:51:29,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 21:51:29,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 21:51:29,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 21:51:29,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 21:51:29,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 21:51:29,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 21:51:29,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 21:51:29,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 21:51:29,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 21:51:29,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 21:51:29,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 21:51:29,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 21:51:29,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 21:51:29,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 21:51:29,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 21:51:29,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 21:51:29,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 21:51:29,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 21:51:29,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 21:51:29,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 21:51:29,517 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 21:51:29,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 21:51:29,518 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 21:51:29,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 21:51:29,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 21:51:29,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 21:51:29,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 21:51:29,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 21:51:29,521 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 21:51:29,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 21:51:29,521 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 21:51:29,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 21:51:29,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 21:51:29,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 21:51:29,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 21:51:29,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 21:51:29,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 21:51:29,523 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 21:51:29,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 21:51:29,523 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 21:51:29,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 21:51:29,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 21:51:29,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 21:51:29,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 21:51:29,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:51:29,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 21:51:29,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 21:51:29,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 21:51:29,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 21:51:29,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 21:51:29,525 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 21:51:29,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 21:51:29,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 21:51:29,526 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 21:51:29,526 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 -> f19b0f8887e7e48eabb6ce59c44b5494c064f6817a5ff1a77078d9e3a8f8600e [2021-12-15 21:51:29,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 21:51:29,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 21:51:29,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 21:51:29,793 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 21:51:29,795 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 21:51:29,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ms1.c [2021-12-15 21:51:29,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03da327e1/0f30b111f8ed462c9c393c46cbf4043b/FLAG1f3438049 [2021-12-15 21:51:30,229 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 21:51:30,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms1.c [2021-12-15 21:51:30,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03da327e1/0f30b111f8ed462c9c393c46cbf4043b/FLAG1f3438049 [2021-12-15 21:51:30,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03da327e1/0f30b111f8ed462c9c393c46cbf4043b [2021-12-15 21:51:30,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 21:51:30,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 21:51:30,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 21:51:30,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 21:51:30,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 21:51:30,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfa96f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30, skipping insertion in model container [2021-12-15 21:51:30,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 21:51:30,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 21:51:30,776 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/ms1.c[586,599] [2021-12-15 21:51:30,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:51:30,803 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 21:51:30,823 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/ms1.c[586,599] [2021-12-15 21:51:30,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:51:30,849 INFO L208 MainTranslator]: Completed translation [2021-12-15 21:51:30,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30 WrapperNode [2021-12-15 21:51:30,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 21:51:30,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 21:51:30,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 21:51:30,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 21:51:30,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,874 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2021-12-15 21:51:30,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 21:51:30,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 21:51:30,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 21:51:30,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 21:51:30,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 21:51:30,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 21:51:30,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 21:51:30,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 21:51:30,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (1/1) ... [2021-12-15 21:51:30,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:51:30,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:51:30,940 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 21:51:30,941 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 21:51:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 21:51:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 21:51:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 21:51:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 21:51:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 21:51:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 21:51:30,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 21:51:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 21:51:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 21:51:31,038 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 21:51:31,040 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 21:51:31,154 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 21:51:31,159 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 21:51:31,159 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 21:51:31,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:51:31 BoogieIcfgContainer [2021-12-15 21:51:31,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 21:51:31,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 21:51:31,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 21:51:31,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 21:51:31,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:51:30" (1/3) ... [2021-12-15 21:51:31,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f5d7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:51:31, skipping insertion in model container [2021-12-15 21:51:31,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:51:30" (2/3) ... [2021-12-15 21:51:31,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f5d7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:51:31, skipping insertion in model container [2021-12-15 21:51:31,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:51:31" (3/3) ... [2021-12-15 21:51:31,199 INFO L111 eAbstractionObserver]: Analyzing ICFG ms1.c [2021-12-15 21:51:31,203 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 21:51:31,203 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 21:51:31,252 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 21:51:31,264 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 21:51:31,264 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 21:51:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:51:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 21:51:31,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:51:31,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:51:31,285 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:51:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:51:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-15 21:51:31,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:51:31,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432664210] [2021-12-15 21:51:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:51:31,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:51:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:51:31,422 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 21:51:31,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:51:31,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432664210] [2021-12-15 21:51:31,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432664210] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:51:31,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:51:31,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 21:51:31,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44436471] [2021-12-15 21:51:31,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:51:31,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 21:51:31,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:51:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 21:51:31,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:51:31,464 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 21:51:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:51:31,477 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-15 21:51:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 21:51:31,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-15 21:51:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:51:31,485 INFO L225 Difference]: With dead ends: 34 [2021-12-15 21:51:31,486 INFO L226 Difference]: Without dead ends: 15 [2021-12-15 21:51:31,488 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 21:51:31,492 INFO L933 BasicCegarLoop]: 22 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, 22 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 21:51:31,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:51:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-15 21:51:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-15 21:51:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 21:51:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-15 21:51:31,524 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-15 21:51:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:51:31,524 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-15 21:51:31,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 21:51:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-15 21:51:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 21:51:31,526 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:51:31,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:51:31,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 21:51:31,527 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:51:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:51:31,531 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-15 21:51:31,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:51:31,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411063967] [2021-12-15 21:51:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:51:31,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:51:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:51:31,665 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 21:51:31,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:51:31,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411063967] [2021-12-15 21:51:31,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411063967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:51:31,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:51:31,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:51:31,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825122634] [2021-12-15 21:51:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:51:31,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:51:31,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:51:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:51:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:51:31,671 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 21:51:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:51:31,719 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-15 21:51:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:51:31,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-15 21:51:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:51:31,720 INFO L225 Difference]: With dead ends: 28 [2021-12-15 21:51:31,721 INFO L226 Difference]: Without dead ends: 20 [2021-12-15 21:51:31,723 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 21:51:31,725 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:51:31,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 13 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:51:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-15 21:51:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-15 21:51:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 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 21:51:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-12-15 21:51:31,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2021-12-15 21:51:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:51:31,734 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-12-15 21:51:31,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 21:51:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-12-15 21:51:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 21:51:31,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:51:31,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:51:31,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 21:51:31,739 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:51:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:51:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-15 21:51:31,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:51:31,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944468387] [2021-12-15 21:51:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:51:31,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:51:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:51:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 21:51:31,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:51:31,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944468387] [2021-12-15 21:51:31,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944468387] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:51:31,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:51:31,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:51:31,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320930041] [2021-12-15 21:51:31,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:51:31,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:51:31,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:51:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:51:31,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:51:31,834 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:51:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:51:31,862 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-12-15 21:51:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:51:31,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 21:51:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:51:31,866 INFO L225 Difference]: With dead ends: 25 [2021-12-15 21:51:31,866 INFO L226 Difference]: Without dead ends: 21 [2021-12-15 21:51:31,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 21:51:31,872 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:51:31,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:51:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-15 21:51:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-15 21:51:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 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 21:51:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-15 21:51:31,879 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2021-12-15 21:51:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:51:31,879 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-15 21:51:31,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:51:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-15 21:51:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 21:51:31,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:51:31,881 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:51:31,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 21:51:31,882 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:51:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:51:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -422196611, now seen corresponding path program 1 times [2021-12-15 21:51:31,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:51:31,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761031816] [2021-12-15 21:51:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:51:31,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:51:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:51:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:31,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:51:31,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761031816] [2021-12-15 21:51:31,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761031816] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:51:31,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869573378] [2021-12-15 21:51:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:51:31,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:51:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:51:31,962 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 21:51:31,964 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 21:51:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:51:32,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 21:51:32,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:51:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:32,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:51:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:32,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869573378] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:51:32,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:51:32,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 21:51:32,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259637800] [2021-12-15 21:51:32,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:51:32,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 21:51:32,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:51:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 21:51:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:51:32,176 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:51:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:51:32,239 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-12-15 21:51:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 21:51:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 21:51:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:51:32,240 INFO L225 Difference]: With dead ends: 39 [2021-12-15 21:51:32,240 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 21:51:32,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-15 21:51:32,242 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:51:32,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 28 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:51:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 21:51:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-15 21:51:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:51:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-15 21:51:32,246 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-15 21:51:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:51:32,246 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-15 21:51:32,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:51:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-15 21:51:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 21:51:32,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:51:32,248 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:51:32,276 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 21:51:32,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:51:32,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:51:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:51:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 2 times [2021-12-15 21:51:32,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:51:32,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937886051] [2021-12-15 21:51:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:51:32,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:51:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:51:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:32,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:51:32,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937886051] [2021-12-15 21:51:32,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937886051] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:51:32,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757404776] [2021-12-15 21:51:32,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:51:32,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:51:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:51:32,736 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 21:51:32,737 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 21:51:32,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 21:51:32,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:51:32,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-15 21:51:32,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:51:32,874 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 15 treesize of output 11 [2021-12-15 21:51:32,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:51:32,964 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 21:51:33,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:51:33,069 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 42 treesize of output 27 [2021-12-15 21:51:33,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:51:33,179 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 45 treesize of output 27 [2021-12-15 21:51:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:33,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:51:33,662 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2021-12-15 21:51:36,330 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 21:51:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-15 21:51:36,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757404776] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:51:36,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:51:36,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2021-12-15 21:51:36,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227277944] [2021-12-15 21:51:36,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:51:36,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 21:51:36,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:51:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 21:51:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=454, Unknown=6, NotChecked=44, Total=600 [2021-12-15 21:51:36,384 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:51:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:51:36,756 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2021-12-15 21:51:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 21:51:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 21:51:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:51:36,757 INFO L225 Difference]: With dead ends: 38 [2021-12-15 21:51:36,757 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 21:51:36,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=190, Invalid=864, Unknown=6, NotChecked=62, Total=1122 [2021-12-15 21:51:36,758 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:51:36,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 73 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 189 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2021-12-15 21:51:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 21:51:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-12-15 21:51:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:51:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-15 21:51:36,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2021-12-15 21:51:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:51:36,762 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-15 21:51:36,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:51:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-15 21:51:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 21:51:36,762 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:51:36,762 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:51:36,787 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 21:51:36,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:51:36,963 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:51:36,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:51:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash -301520475, now seen corresponding path program 3 times [2021-12-15 21:51:36,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:51:36,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324563647] [2021-12-15 21:51:36,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:51:36,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:51:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:51:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:37,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:51:37,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324563647] [2021-12-15 21:51:37,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324563647] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:51:37,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609936221] [2021-12-15 21:51:37,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 21:51:37,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:51:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:51:37,030 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 21:51:37,034 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 21:51:37,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 21:51:37,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:51:37,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 21:51:37,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:51:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:37,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:51:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:37,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609936221] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:51:37,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:51:37,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 21:51:37,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478537809] [2021-12-15 21:51:37,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:51:37,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 21:51:37,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:51:37,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 21:51:37,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 21:51:37,224 INFO L87 Difference]: Start difference. First operand 25 states and 27 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 21:51:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:51:37,311 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2021-12-15 21:51:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 21:51:37,311 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 24 [2021-12-15 21:51:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:51:37,313 INFO L225 Difference]: With dead ends: 50 [2021-12-15 21:51:37,313 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 21:51:37,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 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 21:51:37,315 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:51:37,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:51:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 21:51:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-15 21:51:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 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 21:51:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-15 21:51:37,324 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-15 21:51:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:51:37,324 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-15 21:51:37,324 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 21:51:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-15 21:51:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:51:37,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:51:37,325 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:51:37,354 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 21:51:37,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:51:37,552 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:51:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:51:37,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1384678109, now seen corresponding path program 4 times [2021-12-15 21:51:37,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:51:37,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789043890] [2021-12-15 21:51:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:51:37,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:51:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:51:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:37,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:51:37,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789043890] [2021-12-15 21:51:37,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789043890] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:51:37,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333197996] [2021-12-15 21:51:37,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 21:51:37,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:51:37,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:51:37,902 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 21:51:37,917 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 21:51:37,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 21:51:37,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:51:37,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-15 21:51:37,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:51:38,008 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 17 treesize of output 13 [2021-12-15 21:51:38,073 INFO L354 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2021-12-15 21:51:38,073 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 1 case distinctions, treesize of input 27 treesize of output 26 [2021-12-15 21:51:38,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:51:38,192 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 21:51:38,193 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 34 treesize of output 36 [2021-12-15 21:51:38,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:51:38,316 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-12-15 21:51:38,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2021-12-15 21:51:38,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:51:38,432 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 21:51:38,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 41 [2021-12-15 21:51:38,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:51:38,546 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 21:51:38,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 30 [2021-12-15 21:51:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:51:38,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:51:39,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse1))) 0)) is different from false [2021-12-15 21:51:58,639 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 21:51:58,640 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 29898 treesize of output 28554 [2021-12-15 21:52:00,626 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-15 21:52:00,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-15 21:52:00,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-15 21:52:00,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942568281] [2021-12-15 21:52:00,627 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-15 21:52:00,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 21:52:00,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:52:00,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 21:52:00,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=896, Unknown=21, NotChecked=62, Total=1122 [2021-12-15 21:52:00,629 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:52:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:52:00,873 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2021-12-15 21:52:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 21:52:00,874 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 21:52:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:52:00,875 INFO L225 Difference]: With dead ends: 46 [2021-12-15 21:52:00,875 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 21:52:00,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=188, Invalid=1127, Unknown=21, NotChecked=70, Total=1406 [2021-12-15 21:52:00,876 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:52:00,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 55 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:52:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 21:52:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-12-15 21:52:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:52:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-15 21:52:00,880 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2021-12-15 21:52:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:52:00,880 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-15 21:52:00,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:52:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-15 21:52:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:52:00,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:52:00,882 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:52:00,909 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 21:52:01,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:52:01,083 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:52:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:52:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash -483356095, now seen corresponding path program 5 times [2021-12-15 21:52:01,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:52:01,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850753382] [2021-12-15 21:52:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:52:01,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:52:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:52:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:52:01,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:52:01,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850753382] [2021-12-15 21:52:01,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850753382] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:52:01,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682702726] [2021-12-15 21:52:01,179 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 21:52:01,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:52:01,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:52:01,180 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 21:52:01,180 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 21:52:01,247 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-15 21:52:01,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:52:01,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 21:52:01,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:52:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:52:01,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:52:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:52:01,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682702726] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:52:01,435 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:52:01,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-15 21:52:01,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011083749] [2021-12-15 21:52:01,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:52:01,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 21:52:01,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:52:01,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 21:52:01,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:52:01,438 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:52:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:52:01,541 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-12-15 21:52:01,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 21:52:01,542 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 21:52:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:52:01,542 INFO L225 Difference]: With dead ends: 61 [2021-12-15 21:52:01,542 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 21:52:01,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-15 21:52:01,543 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:52:01,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 30 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:52:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 21:52:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-15 21:52:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 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 21:52:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-15 21:52:01,547 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2021-12-15 21:52:01,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:52:01,547 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-15 21:52:01,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:52:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-15 21:52:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 21:52:01,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:52:01,548 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:52:01,568 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 21:52:01,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:52:01,760 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:52:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:52:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1023492733, now seen corresponding path program 6 times [2021-12-15 21:52:01,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:52:01,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042504080] [2021-12-15 21:52:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:52:01,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:52:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:52:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:52:02,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:52:02,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042504080] [2021-12-15 21:52:02,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042504080] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:52:02,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591817314] [2021-12-15 21:52:02,403 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 21:52:02,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:52:02,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:52:02,404 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 21:52:02,405 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 21:52:02,460 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-15 21:52:02,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:52:02,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-15 21:52:02,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:52:02,482 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 21:52:02,529 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 17 treesize of output 13 [2021-12-15 21:52:02,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-15 21:52:02,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-15 21:52:02,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,759 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 35 treesize of output 40 [2021-12-15 21:52:02,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,838 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 63 treesize of output 52 [2021-12-15 21:52:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:02,937 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 63 treesize of output 52 [2021-12-15 21:52:03,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:03,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:03,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 21:52:03,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:52:03,044 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2021-12-15 21:52:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:52:03,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:52:04,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse1 .cse2)))) 0)) is different from false [2021-12-15 21:52:15,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (let ((.cse1 (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|) (mod 0 1))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse3))))) 0)) is different from false [2021-12-15 21:52:17,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) (mod 0 1))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse3))))) 0)) is different from false [2021-12-15 21:52:18,580 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse5 (mod 0 1))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse5) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4) .cse5))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))))))) 0)) is different from false [2021-12-15 21:52:20,058 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse5 (mod 0 1))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4) .cse5) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 8) .cse5))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))))))) 0)) is different from false [2021-12-15 21:52:20,135 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-15 21:52:20,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4600736 treesize of output 4452992