./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina1.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 b1c30dcb0753c92b26d7933797d6cb35ad9e557c83930a4dbbba40b5521c6adf --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:43:03,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:43:03,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:43:03,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:43:03,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:43:03,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:43:03,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:43:03,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:43:03,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:43:03,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:43:03,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:43:03,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:43:03,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:43:03,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:43:03,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:43:03,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:43:03,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:43:03,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:43:03,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:43:03,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:43:03,689 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:43:03,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:43:03,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:43:03,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:43:03,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:43:03,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:43:03,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:43:03,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:43:03,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:43:03,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:43:03,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:43:03,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:43:03,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:43:03,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:43:03,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:43:03,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:43:03,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:43:03,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:43:03,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:43:03,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:43:03,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:43:03,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:43:03,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:43:03,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:43:03,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:43:03,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:43:03,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:43:03,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:43:03,732 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:43:03,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:43:03,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:43:03,733 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:43:03,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:43:03,734 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:43:03,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:43:03,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:43:03,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:43:03,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:43:03,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:43:03,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:43:03,735 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:43:03,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:43:03,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:43:03,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:43:03,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:43:03,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:43:03,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:43:03,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:43:03,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:43:03,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:43:03,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:43:03,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:43:03,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:43:03,737 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:43:03,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:43:03,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:43:03,738 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 -> b1c30dcb0753c92b26d7933797d6cb35ad9e557c83930a4dbbba40b5521c6adf [2022-07-19 10:43:03,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:43:03,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:43:03,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:43:03,952 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:43:03,952 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:43:03,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina1.c [2022-07-19 10:43:03,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76617ba0/87c94bd1f0b0448cb9d36b6afc5c186c/FLAG28a00d3e7 [2022-07-19 10:43:04,357 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:43:04,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina1.c [2022-07-19 10:43:04,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76617ba0/87c94bd1f0b0448cb9d36b6afc5c186c/FLAG28a00d3e7 [2022-07-19 10:43:04,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c76617ba0/87c94bd1f0b0448cb9d36b6afc5c186c [2022-07-19 10:43:04,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:43:04,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:43:04,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:43:04,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:43:04,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:43:04,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:43:04" (1/1) ... [2022-07-19 10:43:04,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1b1ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:04, skipping insertion in model container [2022-07-19 10:43:04,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:43:04" (1/1) ... [2022-07-19 10:43:04,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:43:04,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:43:04,970 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/sina1.c[588,601] [2022-07-19 10:43:04,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:43:04,994 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:43:05,016 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/sina1.c[588,601] [2022-07-19 10:43:05,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:43:05,029 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:43:05,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05 WrapperNode [2022-07-19 10:43:05,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:43:05,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:43:05,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:43:05,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:43:05,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,057 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-07-19 10:43:05,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:43:05,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:43:05,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:43:05,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:43:05,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:43:05,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:43:05,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:43:05,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:43:05,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (1/1) ... [2022-07-19 10:43:05,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:43:05,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:43:05,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:43:05,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:43:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:43:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:43:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:43:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:43:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:43:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:43:05,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:43:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:43:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:43:05,211 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:43:05,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:43:05,346 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:43:05,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:43:05,350 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 10:43:05,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:43:05 BoogieIcfgContainer [2022-07-19 10:43:05,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:43:05,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:43:05,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:43:05,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:43:05,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:43:04" (1/3) ... [2022-07-19 10:43:05,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717f32d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:43:05, skipping insertion in model container [2022-07-19 10:43:05,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:43:05" (2/3) ... [2022-07-19 10:43:05,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717f32d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:43:05, skipping insertion in model container [2022-07-19 10:43:05,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:43:05" (3/3) ... [2022-07-19 10:43:05,369 INFO L111 eAbstractionObserver]: Analyzing ICFG sina1.c [2022-07-19 10:43:05,385 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:43:05,386 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:43:05,414 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:43:05,423 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1aab372d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b6db642 [2022-07-19 10:43:05,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:43:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 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) [2022-07-19 10:43:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 10:43:05,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:05,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:05,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2022-07-19 10:43:05,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:05,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230082299] [2022-07-19 10:43:05,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:05,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:05,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230082299] [2022-07-19 10:43:05,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230082299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:43:05,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:43:05,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:43:05,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568989536] [2022-07-19 10:43:05,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:43:05,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:43:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:05,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:43:05,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:43:05,631 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:43:05,641 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-19 10:43:05,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:43:05,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-19 10:43:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:43:05,648 INFO L225 Difference]: With dead ends: 38 [2022-07-19 10:43:05,648 INFO L226 Difference]: Without dead ends: 17 [2022-07-19 10:43:05,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:43:05,654 INFO L413 NwaCegarLoop]: 24 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, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:43:05,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:43:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-19 10:43:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-19 10:43:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-19 10:43:05,677 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-07-19 10:43:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:43:05,677 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-19 10:43:05,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-19 10:43:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 10:43:05,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:05,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:05,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:43:05,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:05,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2022-07-19 10:43:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:05,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322098275] [2022-07-19 10:43:05,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:05,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:05,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322098275] [2022-07-19 10:43:05,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322098275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:43:05,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:43:05,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:43:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095733964] [2022-07-19 10:43:05,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:43:05,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:43:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:43:05,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:43:05,784 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:43:05,839 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-19 10:43:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:43:05,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-19 10:43:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:43:05,841 INFO L225 Difference]: With dead ends: 37 [2022-07-19 10:43:05,841 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 10:43:05,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:43:05,842 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:43:05,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:43:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 10:43:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-07-19 10:43:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-19 10:43:05,846 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-07-19 10:43:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:43:05,848 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-19 10:43:05,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-19 10:43:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:43:05,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:05,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:05,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:43:05,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2022-07-19 10:43:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:05,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795128232] [2022-07-19 10:43:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:06,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795128232] [2022-07-19 10:43:06,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795128232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:43:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248136080] [2022-07-19 10:43:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:43:06,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:43:06,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:43:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:06,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 10:43:06,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:43:06,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:43:06,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:43:06,455 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 10:43:06,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-19 10:43:06,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-19 10:43:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:06,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:43:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:14,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248136080] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:43:14,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:43:14,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-07-19 10:43:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892419201] [2022-07-19 10:43:14,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:43:14,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 10:43:14,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:14,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 10:43:14,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=335, Unknown=4, NotChecked=0, Total=420 [2022-07-19 10:43:14,764 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:43:15,072 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-07-19 10:43:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 10:43:15,072 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 10:43:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:43:15,073 INFO L225 Difference]: With dead ends: 41 [2022-07-19 10:43:15,073 INFO L226 Difference]: Without dead ends: 39 [2022-07-19 10:43:15,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=259, Invalid=793, Unknown=4, NotChecked=0, Total=1056 [2022-07-19 10:43:15,074 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:43:15,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 99 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 190 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-19 10:43:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-19 10:43:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2022-07-19 10:43:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-19 10:43:15,078 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2022-07-19 10:43:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:43:15,079 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-19 10:43:15,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-19 10:43:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:43:15,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:15,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:15,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 10:43:15,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:15,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1174519208, now seen corresponding path program 2 times [2022-07-19 10:43:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:15,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073806282] [2022-07-19 10:43:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:15,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073806282] [2022-07-19 10:43:15,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073806282] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:43:15,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486841115] [2022-07-19 10:43:15,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:43:15,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:43:15,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:43:15,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:43:15,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:43:15,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:43:15,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:43:15,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:43:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:15,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:43:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:15,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486841115] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:43:15,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:43:15,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:43:15,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628139330] [2022-07-19 10:43:15,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:43:15,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:43:15,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:15,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:43:15,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:43:15,503 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:43:15,614 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-07-19 10:43:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:43:15,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-19 10:43:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:43:15,618 INFO L225 Difference]: With dead ends: 58 [2022-07-19 10:43:15,618 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 10:43:15,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:43:15,622 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:43:15,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 81 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:43:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 10:43:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2022-07-19 10:43:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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) [2022-07-19 10:43:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-19 10:43:15,638 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2022-07-19 10:43:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:43:15,638 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-19 10:43:15,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-19 10:43:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:43:15,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:15,639 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:15,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:43:15,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 10:43:15,857 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:15,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash 798963152, now seen corresponding path program 1 times [2022-07-19 10:43:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:15,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122985203] [2022-07-19 10:43:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:15,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:43:15,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:15,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122985203] [2022-07-19 10:43:15,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122985203] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:43:15,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547922669] [2022-07-19 10:43:15,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:15,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:15,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:43:15,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:43:15,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:43:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:15,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:43:15,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:43:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:43:15,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:43:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:43:16,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547922669] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:43:16,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:43:16,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:43:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276437493] [2022-07-19 10:43:16,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:43:16,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:43:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:43:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:43:16,024 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) [2022-07-19 10:43:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:43:16,090 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-07-19 10:43:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:43:16,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) Word has length 20 [2022-07-19 10:43:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:43:16,091 INFO L225 Difference]: With dead ends: 58 [2022-07-19 10:43:16,092 INFO L226 Difference]: Without dead ends: 37 [2022-07-19 10:43:16,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:43:16,092 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:43:16,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 52 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:43:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-19 10:43:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2022-07-19 10:43:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-19 10:43:16,096 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2022-07-19 10:43:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:43:16,097 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-19 10:43:16,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) [2022-07-19 10:43:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-07-19 10:43:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:43:16,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:16,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:16,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:43:16,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:16,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:16,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1786143722, now seen corresponding path program 3 times [2022-07-19 10:43:16,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:16,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721485779] [2022-07-19 10:43:16,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:16,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:16,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:16,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721485779] [2022-07-19 10:43:16,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721485779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:43:16,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784907165] [2022-07-19 10:43:16,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:43:16,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:16,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:43:16,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:43:16,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:43:16,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 10:43:16,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:43:16,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 10:43:16,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:43:16,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:43:16,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:43:16,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:43:16,801 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 10:43:16,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-19 10:43:16,850 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-19 10:43:16,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-07-19 10:43:16,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-19 10:43:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:16,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:43:51,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_46| Int) (v_ArrVal_130 Int)) (or (= c_~N~0 (select (store (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ (* |v_ULTIMATE.start_main_~i~0#1_46| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_46| 1) c_~N~0))) is different from false [2022-07-19 10:43:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-19 10:43:55,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784907165] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:43:55,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:43:55,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 37 [2022-07-19 10:43:55,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111033875] [2022-07-19 10:43:55,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:43:55,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-19 10:43:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:55,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-19 10:43:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1085, Unknown=16, NotChecked=68, Total=1332 [2022-07-19 10:43:55,995 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:06,738 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_130 Int)) (= c_~N~0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (<= c_~N~0 .cse0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse0 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-19 10:44:08,742 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_130 Int)) (= c_~N~0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= .cse0 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= c_~N~0 .cse0))) is different from false [2022-07-19 10:44:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:21,257 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-07-19 10:44:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-19 10:44:21,257 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 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 20 [2022-07-19 10:44:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:21,258 INFO L225 Difference]: With dead ends: 77 [2022-07-19 10:44:21,258 INFO L226 Difference]: Without dead ends: 75 [2022-07-19 10:44:21,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 64.3s TimeCoverageRelationStatistics Valid=451, Invalid=2843, Unknown=24, NotChecked=342, Total=3660 [2022-07-19 10:44:21,261 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:21,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 221 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 227 Invalid, 0 Unknown, 181 Unchecked, 0.1s Time] [2022-07-19 10:44:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-19 10:44:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 36. [2022-07-19 10:44:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-19 10:44:21,267 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2022-07-19 10:44:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:21,268 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-19 10:44:21,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-19 10:44:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:44:21,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:21,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:21,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:44:21,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:21,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1232945932, now seen corresponding path program 2 times [2022-07-19 10:44:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:21,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066172639] [2022-07-19 10:44:21,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:21,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:21,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066172639] [2022-07-19 10:44:21,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066172639] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:21,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794486705] [2022-07-19 10:44:21,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:44:21,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:21,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:44:21,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:44:21,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:44:21,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:44:21,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 10:44:21,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:21,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:44:21,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:44:21,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-07-19 10:44:22,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:22,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-19 10:44:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:44:22,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:44:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:44:22,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794486705] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:44:22,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:44:22,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 34 [2022-07-19 10:44:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633362263] [2022-07-19 10:44:22,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:44:22,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 10:44:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 10:44:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 10:44:22,488 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:25,816 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-07-19 10:44:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-19 10:44:25,817 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:44:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:25,818 INFO L225 Difference]: With dead ends: 86 [2022-07-19 10:44:25,818 INFO L226 Difference]: Without dead ends: 84 [2022-07-19 10:44:25,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=583, Invalid=3077, Unknown=0, NotChecked=0, Total=3660 [2022-07-19 10:44:25,820 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 131 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:25,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 177 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 478 Invalid, 0 Unknown, 88 Unchecked, 0.3s Time] [2022-07-19 10:44:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-19 10:44:25,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2022-07-19 10:44:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-19 10:44:25,840 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2022-07-19 10:44:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:25,840 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-19 10:44:25,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-19 10:44:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:44:25,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:25,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:25,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:44:26,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:26,064 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1049585326, now seen corresponding path program 4 times [2022-07-19 10:44:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:26,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316991474] [2022-07-19 10:44:26,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:26,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:26,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316991474] [2022-07-19 10:44:26,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316991474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:26,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475445990] [2022-07-19 10:44:26,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:44:26,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:26,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:26,625 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:44:26,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 10:44:26,689 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:44:26,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:44:26,691 WARN L261 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-19 10:44:26,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:26,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:44:26,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:44:26,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:44:26,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 10:44:26,904 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-19 10:44:26,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-07-19 10:44:26,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:26,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-19 10:44:27,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:27,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-19 10:44:27,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-19 10:44:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:27,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:44:46,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_219 Int) (v_ArrVal_216 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_66| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (= c_~N~0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_216) (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-07-19 10:45:04,625 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:45:04,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-19 10:45:04,630 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:45:04,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-19 10:45:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-07-19 10:45:04,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475445990] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:45:04,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:45:04,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 39 [2022-07-19 10:45:04,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235372791] [2022-07-19 10:45:04,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:45:04,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 10:45:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:45:04,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 10:45:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1242, Unknown=14, NotChecked=72, Total=1482 [2022-07-19 10:45:04,633 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:33,473 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_66|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_66| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (and (forall ((|ULTIMATE.start_main_~a~0#1.base| Int) (v_ArrVal_219 Int) (v_ArrVal_216 Int)) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse1)) |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_216) (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((|ULTIMATE.start_main_~a~0#1.base| Int) (v_ArrVal_219 Int) (v_ArrVal_216 Int)) (<= (select (store (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse3)) |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_216) (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_219 Int) (v_ArrVal_216 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_66|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_66| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (= c_~N~0 (select (store (store (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_216) (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-07-19 10:45:37,874 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse0 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_219 Int) (v_ArrVal_216 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_66| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (= c_~N~0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_216) (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ c_~N~0 (- 3)) 0) (<= 3 .cse0))) is different from false [2022-07-19 10:45:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:45:40,115 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2022-07-19 10:45:40,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-19 10:45:40,115 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:45:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:45:40,116 INFO L225 Difference]: With dead ends: 111 [2022-07-19 10:45:40,116 INFO L226 Difference]: Without dead ends: 109 [2022-07-19 10:45:40,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 73.0s TimeCoverageRelationStatistics Valid=289, Invalid=2449, Unknown=30, NotChecked=312, Total=3080 [2022-07-19 10:45:40,117 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:45:40,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 228 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 243 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2022-07-19 10:45:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-19 10:45:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 62. [2022-07-19 10:45:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-07-19 10:45:40,130 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 24 [2022-07-19 10:45:40,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:45:40,132 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-07-19 10:45:40,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-07-19 10:45:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:45:40,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:45:40,134 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:45:40,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 10:45:40,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:40,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:45:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:45:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash -55017726, now seen corresponding path program 3 times [2022-07-19 10:45:40,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:45:40,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115048505] [2022-07-19 10:45:40,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:45:40,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:45:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:45:40,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:45:40,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115048505] [2022-07-19 10:45:40,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115048505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:45:40,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629625196] [2022-07-19 10:45:40,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:45:40,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:40,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:45:40,420 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:45:40,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 10:45:40,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 10:45:40,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:45:40,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:45:40,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:45:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:45:40,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:45:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:45:40,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629625196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:45:40,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:45:40,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:45:40,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540245399] [2022-07-19 10:45:40,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:45:40,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:45:40,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:45:40,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:45:40,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:45:40,590 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:45:40,676 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2022-07-19 10:45:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:45:40,677 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-19 10:45:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:45:40,677 INFO L225 Difference]: With dead ends: 108 [2022-07-19 10:45:40,677 INFO L226 Difference]: Without dead ends: 76 [2022-07-19 10:45:40,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:45:40,678 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:45:40,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 75 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:45:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-19 10:45:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2022-07-19 10:45:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-07-19 10:45:40,684 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 28 [2022-07-19 10:45:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:45:40,684 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-07-19 10:45:40,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-07-19 10:45:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:45:40,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:45:40,685 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:45:40,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:45:40,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:40,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:45:40,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:45:40,902 INFO L85 PathProgramCache]: Analyzing trace with hash 778799246, now seen corresponding path program 5 times [2022-07-19 10:45:40,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:45:40,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943660640] [2022-07-19 10:45:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:45:40,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:45:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:45:41,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943660640] [2022-07-19 10:45:41,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943660640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:45:41,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682382339] [2022-07-19 10:45:41,368 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:45:41,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:41,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:45:41,374 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:45:41,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 10:45:41,446 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-19 10:45:41,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:45:41,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-19 10:45:41,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:45:41,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:45:41,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:45:41,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 10:45:41,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 10:45:41,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:45:41,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:41,683 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 10:45:41,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-19 10:45:41,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:41,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-19 10:45:41,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:41,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-19 10:45:41,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:41,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 10:45:41,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-19 10:45:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:41,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:45:44,556 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_312 Int) (v_ArrVal_311 Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (v_ArrVal_309 Int)) (<= (select (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_309) (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_311) (+ .cse0 12 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_312)) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (forall ((v_ArrVal_312 Int) (v_ArrVal_311 Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (v_ArrVal_309 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) (select (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_309) (+ .cse1 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_311) (+ .cse1 12 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_312)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-19 10:45:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-19 10:45:44,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682382339] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:45:44,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:45:44,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 19] total 54 [2022-07-19 10:45:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104942129] [2022-07-19 10:45:44,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:45:44,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-19 10:45:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:45:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-19 10:45:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2532, Unknown=1, NotChecked=102, Total=2862 [2022-07-19 10:45:44,728 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:45:48,204 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2022-07-19 10:45:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-19 10:45:48,204 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-19 10:45:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:45:48,205 INFO L225 Difference]: With dead ends: 145 [2022-07-19 10:45:48,205 INFO L226 Difference]: Without dead ends: 132 [2022-07-19 10:45:48,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1705 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=653, Invalid=6832, Unknown=1, NotChecked=170, Total=7656 [2022-07-19 10:45:48,207 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 117 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:45:48,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 374 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 816 Invalid, 0 Unknown, 255 Unchecked, 0.4s Time] [2022-07-19 10:45:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-19 10:45:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 71. [2022-07-19 10:45:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-07-19 10:45:48,215 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 28 [2022-07-19 10:45:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:45:48,215 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-07-19 10:45:48,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-07-19 10:45:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:45:48,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:45:48,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:45:48,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 10:45:48,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 10:45:48,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:45:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:45:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1146912830, now seen corresponding path program 4 times [2022-07-19 10:45:48,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:45:48,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166136834] [2022-07-19 10:45:48,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:45:48,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:45:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:45:48,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166136834] [2022-07-19 10:45:48,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166136834] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:45:48,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925085741] [2022-07-19 10:45:48,866 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:45:48,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:48,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:45:48,868 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:45:48,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 10:45:48,913 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:45:48,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:45:48,914 WARN L261 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-19 10:45:48,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:45:48,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:45:48,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:45:49,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 10:45:49,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:45:49,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:49,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-19 10:45:49,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:49,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:49,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-19 10:45:49,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:49,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:49,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-19 10:45:49,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:49,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 28 [2022-07-19 10:45:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:49,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:45:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:45:50,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925085741] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:45:50,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:45:50,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 51 [2022-07-19 10:45:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655404023] [2022-07-19 10:45:50,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:45:50,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 10:45:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:45:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 10:45:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2265, Unknown=0, NotChecked=0, Total=2550 [2022-07-19 10:45:50,373 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:45:51,214 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2022-07-19 10:45:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-19 10:45:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-19 10:45:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:45:51,218 INFO L225 Difference]: With dead ends: 117 [2022-07-19 10:45:51,218 INFO L226 Difference]: Without dead ends: 115 [2022-07-19 10:45:51,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=594, Invalid=5258, Unknown=0, NotChecked=0, Total=5852 [2022-07-19 10:45:51,220 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 47 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:45:51,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 252 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 264 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2022-07-19 10:45:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-19 10:45:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2022-07-19 10:45:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2022-07-19 10:45:51,241 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 32 [2022-07-19 10:45:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:45:51,241 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2022-07-19 10:45:51,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2022-07-19 10:45:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:45:51,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:45:51,244 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:45:51,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 10:45:51,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:51,461 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:45:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:45:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1680698556, now seen corresponding path program 5 times [2022-07-19 10:45:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:45:51,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119225011] [2022-07-19 10:45:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:45:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:45:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:45:51,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:45:51,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119225011] [2022-07-19 10:45:51,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119225011] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:45:51,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387335449] [2022-07-19 10:45:51,578 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:45:51,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:45:51,579 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:45:51,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 10:45:51,642 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-19 10:45:51,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:45:51,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:45:51,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:45:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:45:51,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:45:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:45:51,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387335449] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:45:51,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:45:51,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-07-19 10:45:51,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897184848] [2022-07-19 10:45:51,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:45:51,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 10:45:51,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:45:51,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 10:45:51,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:45:51,780 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:45:51,967 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2022-07-19 10:45:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 10:45:51,967 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-19 10:45:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:45:51,968 INFO L225 Difference]: With dead ends: 162 [2022-07-19 10:45:51,968 INFO L226 Difference]: Without dead ends: 96 [2022-07-19 10:45:51,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2022-07-19 10:45:51,968 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 249 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:45:51,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 104 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:45:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-19 10:45:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 60. [2022-07-19 10:45:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-07-19 10:45:51,977 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 32 [2022-07-19 10:45:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:45:51,978 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-07-19 10:45:51,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:45:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-07-19 10:45:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:45:51,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:45:51,978 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:45:51,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-19 10:45:52,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 10:45:52,191 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:45:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:45:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1112184374, now seen corresponding path program 6 times [2022-07-19 10:45:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:45:52,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466011687] [2022-07-19 10:45:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:45:52,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:45:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:52,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:45:52,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466011687] [2022-07-19 10:45:52,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466011687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:45:52,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773099215] [2022-07-19 10:45:52,849 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:45:52,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:52,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:45:52,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:45:52,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 10:45:52,935 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-19 10:45:52,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:45:52,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 10:45:52,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:45:52,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:45:52,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:45:53,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:45:53,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 10:45:53,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 10:45:53,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:45:53,294 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-19 10:45:53,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-19 10:45:53,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:53,393 INFO L356 Elim1Store]: treesize reduction 33, result has 36.5 percent of original size [2022-07-19 10:45:53,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-07-19 10:45:53,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:53,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 10:45:53,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:53,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 10:45:53,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:53,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 10:45:53,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-19 10:45:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:53,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:46:46,377 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:46:46,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2022-07-19 10:46:46,385 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:46:46,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2022-07-19 10:46:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:46:46,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773099215] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:46:46,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:46:46,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 28] total 76 [2022-07-19 10:46:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015686136] [2022-07-19 10:46:46,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:46:46,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-19 10:46:46,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:46:46,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-19 10:46:46,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=5085, Unknown=36, NotChecked=0, Total=5700 [2022-07-19 10:46:46,389 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 76 states, 76 states have (on average 1.118421052631579) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:46:47,551 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~i~0#1|) (<= |c_ULTIMATE.start_main_~i~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (v_ArrVal_486 Int) (v_ArrVal_484 Int) (v_ArrVal_482 Int) (v_ArrVal_481 Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int)) (or (= c_~N~0 (select (store (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_481) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_482) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_484) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4)) v_ArrVal_486) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (< |v_ULTIMATE.start_main_~i~0#1_149| c_~N~0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_152| 1) |v_ULTIMATE.start_main_~i~0#1_151|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_152|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-07-19 10:46:49,943 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse1 0))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_486 Int) (v_ArrVal_484 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= c_~N~0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_484) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4)) v_ArrVal_486) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_149| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) c_~N~0))))) (<= .cse0 c_~N~0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= c_~N~0 5) (<= c_~N~0 .cse0) (<= (+ 5 (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4)) c_~N~0) (= 5 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-19 10:47:23,093 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_486 Int) (v_ArrVal_484 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= c_~N~0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_484) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4)) v_ArrVal_486) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_149| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) c_~N~0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_486 Int) (v_ArrVal_484 Int) (v_ArrVal_482 Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= c_~N~0 (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_482) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_484) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4)) v_ArrVal_486) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_149| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) c_~N~0))) (or (forall ((v_ArrVal_486 Int)) (= c_~N~0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_486) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)))) is different from false