./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/sina4.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 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:14:24,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:14:24,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:14:24,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:14:24,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:14:24,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:14:24,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:14:24,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:14:24,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:14:24,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:14:24,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:14:24,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:14:24,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:14:24,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:14:24,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:14:24,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:14:24,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:14:24,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:14:24,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:14:24,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:14:24,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:14:24,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:14:24,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:14:24,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:14:24,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:14:24,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:14:24,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:14:24,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:14:24,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:14:24,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:14:24,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:14:24,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:14:24,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:14:24,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:14:24,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:14:24,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:14:24,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:14:24,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:14:24,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:14:24,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:14:24,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:14:24,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:14:24,995 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:14:24,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:14:24,996 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:14:24,996 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:14:24,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:14:24,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:14:24,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:14:24,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:14:24,997 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:14:24,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:14:24,998 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:14:24,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:14:24,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:14:24,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:14:24,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:14:24,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:14:24,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:14:24,999 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:14:24,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:14:24,999 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:14:24,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:14:24,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:14:24,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:14:24,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:14:25,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:14:25,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:14:25,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:14:25,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:14:25,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:14:25,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:14:25,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:14:25,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:14:25,001 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:14:25,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:14:25,001 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:14:25,001 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 [2023-02-15 10:14:25,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:14:25,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:14:25,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:14:25,238 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:14:25,239 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:14:25,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina4.c [2023-02-15 10:14:26,279 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:14:26,420 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:14:26,421 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c [2023-02-15 10:14:26,426 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529a22f84/e95e84785899415baa3d34722232513e/FLAGa10c1b8b8 [2023-02-15 10:14:26,442 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529a22f84/e95e84785899415baa3d34722232513e [2023-02-15 10:14:26,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:14:26,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:14:26,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:14:26,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:14:26,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:14:26,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f1c087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26, skipping insertion in model container [2023-02-15 10:14:26,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:14:26,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:14:26,554 WARN L237 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/sina4.c[588,601] [2023-02-15 10:14:26,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:14:26,584 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:14:26,593 WARN L237 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/sina4.c[588,601] [2023-02-15 10:14:26,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:14:26,608 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:14:26,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26 WrapperNode [2023-02-15 10:14:26,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:14:26,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:14:26,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:14:26,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:14:26,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,631 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2023-02-15 10:14:26,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:14:26,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:14:26,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:14:26,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:14:26,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,652 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:14:26,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:14:26,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:14:26,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:14:26,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (1/1) ... [2023-02-15 10:14:26,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:14:26,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:26,684 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) [2023-02-15 10:14:26,685 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 [2023-02-15 10:14:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:14:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:14:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:14:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:14:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:14:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:14:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:14:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:14:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:14:26,780 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:14:26,781 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:14:26,991 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:14:26,996 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:14:26,996 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 10:14:26,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:14:26 BoogieIcfgContainer [2023-02-15 10:14:26,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:14:27,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:14:27,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:14:27,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:14:27,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:14:26" (1/3) ... [2023-02-15 10:14:27,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dafd612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:14:27, skipping insertion in model container [2023-02-15 10:14:27,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:26" (2/3) ... [2023-02-15 10:14:27,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dafd612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:14:27, skipping insertion in model container [2023-02-15 10:14:27,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:14:26" (3/3) ... [2023-02-15 10:14:27,006 INFO L112 eAbstractionObserver]: Analyzing ICFG sina4.c [2023-02-15 10:14:27,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:14:27,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:14:27,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:14:27,054 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a4f1332, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:14:27,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:14:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:14:27,061 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:27,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:27,062 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:27,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2023-02-15 10:14:27,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:27,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212038876] [2023-02-15 10:14:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:27,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:27,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212038876] [2023-02-15 10:14:27,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212038876] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:14:27,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:14:27,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:14:27,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136806002] [2023-02-15 10:14:27,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:14:27,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:14:27,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:14:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:14:27,234 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:27,246 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2023-02-15 10:14:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:14:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 10:14:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:27,253 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:14:27,253 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 10:14:27,255 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 [2023-02-15 10:14:27,258 INFO L413 NwaCegarLoop]: 32 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, 32 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 [2023-02-15 10:14:27,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:14:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 10:14:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 10:14:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 10:14:27,280 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2023-02-15 10:14:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:27,280 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 10:14:27,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 10:14:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:14:27,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:27,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:27,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:14:27,282 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:27,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2023-02-15 10:14:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:27,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530047112] [2023-02-15 10:14:27,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:27,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530047112] [2023-02-15 10:14:27,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530047112] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:14:27,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:14:27,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:14:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195497056] [2023-02-15 10:14:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:14:27,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:14:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:14:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:14:27,430 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:27,498 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-02-15 10:14:27,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:14:27,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 10:14:27,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:27,500 INFO L225 Difference]: With dead ends: 53 [2023-02-15 10:14:27,500 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 10:14:27,503 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 [2023-02-15 10:14:27,505 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:27,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:14:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 10:14:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-02-15 10:14:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-02-15 10:14:27,519 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2023-02-15 10:14:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:27,519 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-15 10:14:27,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-02-15 10:14:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:14:27,520 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:27,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:27,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:14:27,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:27,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:27,522 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2023-02-15 10:14:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:27,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533633654] [2023-02-15 10:14:27,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:27,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533633654] [2023-02-15 10:14:28,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533633654] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:14:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86157683] [2023-02-15 10:14:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:28,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:28,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:28,768 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) [2023-02-15 10:14:28,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:14:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:28,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-15 10:14:28,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:28,867 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:14:28,876 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:14:28,891 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:14:28,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-15 10:14:29,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-15 10:14:29,222 INFO L321 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-02-15 10:14:29,222 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 44 [2023-02-15 10:14:29,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:14:29,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 72 [2023-02-15 10:14:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:29,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:14:41,759 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:41,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86157683] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:14:41,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:14:41,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2023-02-15 10:14:41,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097253769] [2023-02-15 10:14:41,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:14:41,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 10:14:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 10:14:41,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=919, Unknown=2, NotChecked=0, Total=1056 [2023-02-15 10:14:41,770 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 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) [2023-02-15 10:14:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:42,434 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2023-02-15 10:14:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 10:14:42,435 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 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 [2023-02-15 10:14:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:42,436 INFO L225 Difference]: With dead ends: 59 [2023-02-15 10:14:42,436 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 10:14:42,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=246, Invalid=1644, Unknown=2, NotChecked=0, Total=1892 [2023-02-15 10:14:42,437 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 60 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:42,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 150 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:14:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 10:14:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2023-02-15 10:14:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 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) [2023-02-15 10:14:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2023-02-15 10:14:42,444 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 24 [2023-02-15 10:14:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:42,444 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2023-02-15 10:14:42,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 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) [2023-02-15 10:14:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2023-02-15 10:14:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:14:42,445 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:42,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:42,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 10:14:42,652 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 [2023-02-15 10:14:42,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2023-02-15 10:14:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:42,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846350818] [2023-02-15 10:14:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:14:42,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:42,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846350818] [2023-02-15 10:14:42,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846350818] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:14:42,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700540941] [2023-02-15 10:14:42,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:14:42,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:42,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:42,725 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) [2023-02-15 10:14:42,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:14:42,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:14:42,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:14:42,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:14:42,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:14:42,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:14:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:14:42,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700540941] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:14:42,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:14:42,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:14:42,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013731501] [2023-02-15 10:14:42,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:14:42,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:14:42,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:42,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:14:42,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:14:42,849 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:42,956 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2023-02-15 10:14:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:14:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 10:14:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:42,958 INFO L225 Difference]: With dead ends: 110 [2023-02-15 10:14:42,959 INFO L226 Difference]: Without dead ends: 66 [2023-02-15 10:14:42,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:14:42,961 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 65 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:42,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 50 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:14:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-15 10:14:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2023-02-15 10:14:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-02-15 10:14:42,981 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2023-02-15 10:14:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:42,981 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-02-15 10:14:42,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-02-15 10:14:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:14:42,985 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:42,985 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:42,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:14:43,194 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 [2023-02-15 10:14:43,194 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2023-02-15 10:14:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:43,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467268486] [2023-02-15 10:14:43,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:43,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:14:43,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:43,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467268486] [2023-02-15 10:14:43,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467268486] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:14:43,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384158790] [2023-02-15 10:14:43,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:14:43,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:43,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:43,263 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) [2023-02-15 10:14:43,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:14:43,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:14:43,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:14:43,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:14:43,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:14:43,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:14:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:14:43,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384158790] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:14:43,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:14:43,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:14:43,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705107666] [2023-02-15 10:14:43,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:14:43,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:14:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:43,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:14:43,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:14:43,402 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:43,495 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-02-15 10:14:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:14:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 10:14:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:43,496 INFO L225 Difference]: With dead ends: 63 [2023-02-15 10:14:43,496 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 10:14:43,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:14:43,497 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 80 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:43,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 45 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:14:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 10:14:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2023-02-15 10:14:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-15 10:14:43,501 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2023-02-15 10:14:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:43,501 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-15 10:14:43,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-15 10:14:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 10:14:43,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:43,502 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:43,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:14:43,710 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 [2023-02-15 10:14:43,710 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:43,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2023-02-15 10:14:43,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:43,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604008539] [2023-02-15 10:14:43,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:44,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:44,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604008539] [2023-02-15 10:14:44,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604008539] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:14:44,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65917870] [2023-02-15 10:14:44,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:14:44,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:44,957 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) [2023-02-15 10:14:44,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:14:45,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:14:45,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:14:45,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 10:14:45,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:45,039 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:14:45,043 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:14:45,071 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:14:45,146 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 37 [2023-02-15 10:14:45,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:45,355 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 10:14:45,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2023-02-15 10:14:45,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:45,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:45,480 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-15 10:14:45,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 60 [2023-02-15 10:14:45,754 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:45,755 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:45,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:45,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:45,757 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:45,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2023-02-15 10:14:45,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:45,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:45,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:45,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2023-02-15 10:14:46,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:46,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:46,065 INFO L321 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2023-02-15 10:14:46,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2023-02-15 10:14:46,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:46,257 INFO L321 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-02-15 10:14:46,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 60 [2023-02-15 10:14:46,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:14:46,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2023-02-15 10:14:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:46,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:14:48,679 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_228 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (= (+ c_~N~0 2) (select (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_228) |c_ULTIMATE.start_main_~b~0#1.offset|)))) is different from false [2023-02-15 10:14:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 10:14:50,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65917870] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:14:50,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:14:50,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 24] total 64 [2023-02-15 10:14:50,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251629292] [2023-02-15 10:14:50,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:14:50,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-02-15 10:14:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:50,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-02-15 10:14:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=3510, Unknown=1, NotChecked=122, Total=4032 [2023-02-15 10:14:50,064 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 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) [2023-02-15 10:16:11,203 WARN L233 SmtUtils]: Spent 52.11s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:16:13,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:15,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:17,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:16:19,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:16:21,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:23,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:25,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:27,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:29,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:31,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:16:41,277 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2023-02-15 10:16:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-02-15 10:16:41,278 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 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) Word has length 32 [2023-02-15 10:16:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:16:41,279 INFO L225 Difference]: With dead ends: 124 [2023-02-15 10:16:41,279 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 10:16:41,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 93.4s TimeCoverageRelationStatistics Valid=1439, Invalid=14314, Unknown=1, NotChecked=248, Total=16002 [2023-02-15 10:16:41,285 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 199 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 184 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:16:41,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 372 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1171 Invalid, 10 Unknown, 76 Unchecked, 22.2s Time] [2023-02-15 10:16:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 10:16:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 68. [2023-02-15 10:16:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 67 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2023-02-15 10:16:41,296 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 32 [2023-02-15 10:16:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:16:41,297 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2023-02-15 10:16:41,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 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) [2023-02-15 10:16:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2023-02-15 10:16:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:16:41,298 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:16:41,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:16:41,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 10:16:41,509 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 [2023-02-15 10:16:41,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:16:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:16:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2023-02-15 10:16:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:16:41,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7639833] [2023-02-15 10:16:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:41,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:16:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:16:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:16:43,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:16:43,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7639833] [2023-02-15 10:16:43,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7639833] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:16:43,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655896755] [2023-02-15 10:16:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:43,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:43,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:16:43,695 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) [2023-02-15 10:16:43,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:16:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:16:43,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 10:16:43,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:16:43,848 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:16:43,858 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:16:43,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2023-02-15 10:16:43,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:16:44,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2023-02-15 10:16:44,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:44,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:44,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-02-15 10:16:44,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:44,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2023-02-15 10:16:44,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:44,582 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:44,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 10:16:44,698 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 25 [2023-02-15 10:16:44,871 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:16:44,872 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 31 treesize of output 38 [2023-02-15 10:16:44,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-02-15 10:16:44,979 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 22 [2023-02-15 10:16:45,208 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:16:45,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2023-02-15 10:16:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:16:45,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:16:45,545 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ c_~N~0 1))) is different from false [2023-02-15 10:16:45,565 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ c_~N~0 1))) is different from false [2023-02-15 10:16:45,818 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_296 Int) (v_ArrVal_300 (Array Int Int))) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_296))) (store .cse0 .cse1 (+ (select .cse2 .cse1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ c_~N~0 1))) is different from false [2023-02-15 10:16:47,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:47,959 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:47,962 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 10:16:47,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 1 [2023-02-15 10:16:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 10:16:47,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655896755] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:16:47,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:16:47,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 23] total 73 [2023-02-15 10:16:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073898224] [2023-02-15 10:16:47,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:16:47,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-02-15 10:16:47,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:16:47,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-02-15 10:16:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=4390, Unknown=68, NotChecked=414, Total=5256 [2023-02-15 10:16:47,975 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 73 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:10,151 INFO L93 Difference]: Finished difference Result 228 states and 259 transitions. [2023-02-15 10:17:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-02-15 10:17:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 0 states have call successors, (0), 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 36 [2023-02-15 10:17:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:10,152 INFO L225 Difference]: With dead ends: 228 [2023-02-15 10:17:10,152 INFO L226 Difference]: Without dead ends: 198 [2023-02-15 10:17:10,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6255 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=2047, Invalid=19640, Unknown=81, NotChecked=882, Total=22650 [2023-02-15 10:17:10,157 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 459 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 204 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:10,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 521 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1983 Invalid, 11 Unknown, 232 Unchecked, 3.5s Time] [2023-02-15 10:17:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-15 10:17:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 106. [2023-02-15 10:17:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 105 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2023-02-15 10:17:10,192 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 36 [2023-02-15 10:17:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:10,193 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2023-02-15 10:17:10,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2023-02-15 10:17:10,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:17:10,197 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:10,197 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:10,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:17:10,405 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 [2023-02-15 10:17:10,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:10,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1705007958, now seen corresponding path program 5 times [2023-02-15 10:17:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:10,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376978648] [2023-02-15 10:17:10,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:17:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:17:10,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:10,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376978648] [2023-02-15 10:17:10,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376978648] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:17:10,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218414777] [2023-02-15 10:17:10,495 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 10:17:10,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:10,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:10,496 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) [2023-02-15 10:17:10,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:17:10,604 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-02-15 10:17:10,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:17:10,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 10:17:10,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:17:10,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:17:10,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218414777] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:10,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:17:10,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2023-02-15 10:17:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40453470] [2023-02-15 10:17:10,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:10,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 10:17:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 10:17:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-02-15 10:17:10,735 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:11,023 INFO L93 Difference]: Finished difference Result 248 states and 282 transitions. [2023-02-15 10:17:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 10:17:11,024 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 10:17:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:11,025 INFO L225 Difference]: With dead ends: 248 [2023-02-15 10:17:11,025 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 10:17:11,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2023-02-15 10:17:11,027 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 226 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:11,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 107 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:17:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 10:17:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2023-02-15 10:17:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.158878504672897) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2023-02-15 10:17:11,052 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 36 [2023-02-15 10:17:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:11,053 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2023-02-15 10:17:11,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2023-02-15 10:17:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:17:11,056 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:11,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:11,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:17:11,262 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 [2023-02-15 10:17:11,262 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:11,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1245131882, now seen corresponding path program 6 times [2023-02-15 10:17:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:11,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939667186] [2023-02-15 10:17:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:11,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:17:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 10:17:11,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:11,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939667186] [2023-02-15 10:17:11,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939667186] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:17:11,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902556651] [2023-02-15 10:17:11,343 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 10:17:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:11,344 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) [2023-02-15 10:17:11,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:17:11,440 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-15 10:17:11,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:17:11,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:17:11,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 10:17:11,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 10:17:11,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902556651] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:11,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:17:11,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 10:17:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000713732] [2023-02-15 10:17:11,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:11,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:17:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:17:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:17:11,554 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:11,715 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2023-02-15 10:17:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:17:11,715 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 10:17:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:11,716 INFO L225 Difference]: With dead ends: 134 [2023-02-15 10:17:11,716 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 10:17:11,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:17:11,717 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 99 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:11,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 70 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:17:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 10:17:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2023-02-15 10:17:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2023-02-15 10:17:11,730 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 36 [2023-02-15 10:17:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:11,731 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2023-02-15 10:17:11,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2023-02-15 10:17:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 10:17:11,731 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:11,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:11,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 10:17:11,936 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 [2023-02-15 10:17:11,937 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2023-02-15 10:17:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:11,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062469089] [2023-02-15 10:17:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:17:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:14,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:14,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062469089] [2023-02-15 10:17:14,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062469089] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:17:14,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961311788] [2023-02-15 10:17:14,179 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 10:17:14,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:14,180 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) [2023-02-15 10:17:14,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 10:17:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:17:14,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 88 conjunts are in the unsatisfiable core [2023-02-15 10:17:14,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:14,264 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:17:14,268 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:17:14,279 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:17:14,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 10:17:14,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-02-15 10:17:14,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2023-02-15 10:17:14,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,600 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:14,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2023-02-15 10:17:14,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-02-15 10:17:14,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,894 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:14,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:14,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 56 [2023-02-15 10:17:15,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:15,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:15,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:15,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:15,050 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:15,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2023-02-15 10:17:15,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:15,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2023-02-15 10:17:15,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:15,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:15,382 INFO L321 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2023-02-15 10:17:15,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2023-02-15 10:17:15,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:15,583 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:15,598 INFO L321 Elim1Store]: treesize reduction 63, result has 23.2 percent of original size [2023-02-15 10:17:15,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 71 [2023-02-15 10:17:15,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:15,802 INFO L321 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-02-15 10:17:15,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 62 [2023-02-15 10:17:15,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:17:15,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 70 [2023-02-15 10:17:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:16,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:02,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961311788] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:02,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:18:02,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 30] total 75 [2023-02-15 10:18:02,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101769338] [2023-02-15 10:18:02,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:02,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-02-15 10:18:02,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-02-15 10:18:02,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=5133, Unknown=13, NotChecked=0, Total=5550 [2023-02-15 10:18:02,631 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 75 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 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) [2023-02-15 10:18:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:08,554 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2023-02-15 10:18:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 10:18:08,555 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 10:18:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:08,556 INFO L225 Difference]: With dead ends: 121 [2023-02-15 10:18:08,556 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 10:18:08,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3045 ImplicationChecksByTransitivity, 52.2s TimeCoverageRelationStatistics Valid=732, Invalid=8566, Unknown=14, NotChecked=0, Total=9312 [2023-02-15 10:18:08,558 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 101 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:08,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 401 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-15 10:18:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 10:18:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2023-02-15 10:18:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1057692307692308) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2023-02-15 10:18:08,577 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 40 [2023-02-15 10:18:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:08,578 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2023-02-15 10:18:08,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 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) [2023-02-15 10:18:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2023-02-15 10:18:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 10:18:08,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:08,579 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:08,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:08,783 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 [2023-02-15 10:18:08,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash -308361392, now seen corresponding path program 8 times [2023-02-15 10:18:08,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:08,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318427790] [2023-02-15 10:18:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:08,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:18:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:08,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318427790] [2023-02-15 10:18:08,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318427790] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:18:08,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699020840] [2023-02-15 10:18:08,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:18:08,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:18:08,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:18:08,884 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) [2023-02-15 10:18:08,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 10:18:08,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:18:08,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:18:08,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 10:18:08,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:18:09,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:18:09,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699020840] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:09,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:18:09,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-15 10:18:09,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187201219] [2023-02-15 10:18:09,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:09,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:18:09,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:09,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:18:09,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:18:09,099 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:09,363 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2023-02-15 10:18:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:18:09,363 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-15 10:18:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:09,364 INFO L225 Difference]: With dead ends: 146 [2023-02-15 10:18:09,364 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 10:18:09,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-02-15 10:18:09,365 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 157 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:09,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 151 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:18:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 10:18:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2023-02-15 10:18:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-02-15 10:18:09,379 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 42 [2023-02-15 10:18:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:09,379 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-02-15 10:18:09,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-02-15 10:18:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 10:18:09,379 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:09,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:09,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:09,584 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 [2023-02-15 10:18:09,584 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2112995272, now seen corresponding path program 2 times [2023-02-15 10:18:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:09,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482378688] [2023-02-15 10:18:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 10:18:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:12,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482378688] [2023-02-15 10:18:12,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482378688] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:18:12,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050604936] [2023-02-15 10:18:12,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:18:12,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:18:12,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:18:12,349 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) [2023-02-15 10:18:12,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 10:18:12,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:18:12,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:18:12,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 103 conjunts are in the unsatisfiable core [2023-02-15 10:18:12,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:12,442 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:18:12,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 102 [2023-02-15 10:18:12,473 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:18:12,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:18:12,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2023-02-15 10:18:12,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2023-02-15 10:18:12,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:12,891 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:18:12,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-02-15 10:18:13,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2023-02-15 10:18:13,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2023-02-15 10:18:13,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:18:13,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2023-02-15 10:18:13,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,489 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:18:13,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 50 [2023-02-15 10:18:13,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2023-02-15 10:18:13,855 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:18:13,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:13,869 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-02-15 10:18:13,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 65 [2023-02-15 10:18:14,026 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:18:14,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:14,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:18:14,039 INFO L321 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2023-02-15 10:18:14,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 52 treesize of output 52 [2023-02-15 10:18:14,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:14,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:14,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:14,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:18:14,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:18:14,199 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-02-15 10:18:14,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 59 [2023-02-15 10:18:14,649 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-02-15 10:18:14,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 44 [2023-02-15 10:18:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:14,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:42,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050604936] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:42,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:18:42,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 33] total 90 [2023-02-15 10:18:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584136306] [2023-02-15 10:18:42,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:42,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2023-02-15 10:18:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:42,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2023-02-15 10:18:42,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=7417, Unknown=8, NotChecked=0, Total=8010 [2023-02-15 10:18:42,123 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 90 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:48,855 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse66 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse111 (+ .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse61 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (select .cse9 .cse111))) (let ((.cse112 (+ .cse6 .cse17))) (let ((.cse16 (+ .cse66 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse104 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse112)))) (let ((.cse106 (select .cse104 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse42 (select .cse9 .cse16)) (.cse65 (div c_~N~0 4294967296))) (let ((.cse64 (* 4294967296 .cse65)) (.cse71 (+ .cse6 .cse42)) (.cse77 (select .cse106 .cse16))) (let ((.cse98 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse17 .cse77)))) (.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse71))) (.cse62 (<= c_~N~0 (+ 536870911 .cse64))) (.cse7 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (+ .cse6 .cse7)) (.cse18 (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse22 (not .cse62)) (.cse19 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse46 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse20 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse51 (store .cse9 .cse111 .cse112)) (.cse38 (+ .cse66 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse81 (select .cse98 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ c_~N~0 2)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| .cse10))) (store .cse8 .cse5 (+ (select .cse9 .cse5) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) .cse11 v_ArrVal_690)))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse6 .cse7 1)))) (store .cse3 .cse1 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= (select .cse0 .cse1) .cse2) (not (= .cse2 (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse12 (store (let ((.cse15 (store .cse9 .cse16 v_ArrVal_690))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse13 (store (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse13 .cse1 (+ (select (select (store .cse14 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= .cse2 (select .cse12 .cse1)) (not (= .cse2 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) (= .cse6 0) (or (and (= .cse17 1) (= (select .cse9 0) 1) .cse18 .cse19 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse20 .cse21 (<= |c_ULTIMATE.start_main_~i~0#1| 1)) .cse22) (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int) (v_ArrVal_677 Int)) (let ((.cse23 (store (let ((.cse37 (store (store .cse9 .cse16 v_ArrVal_677) .cse38 1))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse30 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse27 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse28 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse32 (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29 .cse30))))) (let ((.cse34 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse27 .cse28 .cse29 .cse30 .cse31)))) (store .cse33 .cse5 (+ (select .cse34 .cse5) (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) .cse11 v_ArrVal_690)))) (let ((.cse25 (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse27 .cse28 .cse29 .cse30 .cse31 1)))) (store .cse25 .cse1 (+ (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1))))))))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.offset|))) (or (= (select .cse23 .cse1) .cse24) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) .cse24)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) .cse24) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|)))))) (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse39 (store (let ((.cse43 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 .cse42 .cse43)))) (store .cse45 .cse5 (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse46 .cse5)))) .cse11 v_ArrVal_690)))) (let ((.cse40 (store (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse6 .cse42 .cse43 1)))) (store .cse40 .cse1 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~b~0#1.base| .cse40) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= .cse2 (select .cse39 .cse1)) (not (= .cse2 (select .cse39 |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse47 (store (let ((.cse50 (store .cse51 .cse16 v_ArrVal_690))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse50))) (let ((.cse48 (store (select .cse49 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ 1 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse48 .cse1 (+ (select (select (store .cse49 |c_ULTIMATE.start_main_~b~0#1.base| .cse48) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= (select .cse47 .cse1) .cse2) (not (= (select .cse47 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse52 (store (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse10)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse55 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse55 .cse57 .cse7))))) (let ((.cse60 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse56 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse54 (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 .cse55 .cse56 .cse57 .cse7)))) (store .cse59 .cse5 (+ (select .cse60 .cse5) (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) .cse11 v_ArrVal_690)))) (let ((.cse53 (store (select .cse54 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse6 .cse55 .cse56 .cse57 .cse7 1)))) (store .cse53 .cse1 (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~b~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1))))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (not (= (select .cse52 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2)) (= .cse2 (select .cse52 .cse1)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) .cse18 (or .cse62 (let ((.cse63 (<= (+ 1 .cse65) 0))) (and (or .cse63 (<= (+ 536870911 .cse64 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (or (not .cse63) (<= c_~N~0 (+ .cse64 4294967294 |c_ULTIMATE.start_main_~i~0#1|)))))) (= (select .cse9 (+ .cse66 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse22) .cse19 (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse67 (store (let ((.cse70 (store (store .cse9 .cse16 .cse71) .cse38 v_ArrVal_690))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse70))) (let ((.cse68 (store (select .cse69 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse70 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse68 .cse1 (+ (select (select (store .cse69 |c_ULTIMATE.start_main_~b~0#1.base| .cse68) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= .cse2 (select .cse67 .cse1)) (not (= .cse2 (select .cse67 |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse72 (store (let ((.cse76 (select .cse81 .cse38))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse17 .cse76 .cse77))))) (let ((.cse80 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse75 (select .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse74 (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse79 (store .cse80 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 .cse17 .cse75 .cse76 .cse77)))) (store .cse79 .cse5 (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse79) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse80 .cse5)))) .cse11 v_ArrVal_690)))) (let ((.cse73 (store (select .cse74 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse6 .cse17 .cse75 .cse76 1 .cse77)))) (store .cse73 .cse1 (+ (select (select (store .cse74 |c_ULTIMATE.start_main_~b~0#1.base| .cse73) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= .cse2 (select .cse72 .cse1)) (not (= .cse2 (select .cse72 |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse82 (store (let ((.cse85 (select .cse46 .cse38))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse6 .cse42))))) (let ((.cse89 (select .cse87 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse86 (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse84 (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse88 (store .cse89 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse85 .cse6 .cse42 .cse86)))) (store .cse88 .cse5 (+ (select (select (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse89 .cse5)))) .cse11 v_ArrVal_690)))) (let ((.cse83 (store (select .cse84 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse85 .cse6 .cse42 .cse86 1)))) (store .cse83 .cse1 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~b~0#1.base| .cse83) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1)))))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= .cse2 (select .cse82 .cse1)) (not (= .cse2 (select .cse82 |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) .cse20 (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse90 (store (let ((.cse93 (store (store .cse51 .cse16 (+ .cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse38 v_ArrVal_690))) (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse93))) (let ((.cse91 (store (select .cse92 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse93 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse91 .cse1 (+ (select (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| .cse91) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= .cse2 (select .cse90 .cse1)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|)) (not (= .cse2 (select .cse90 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) .cse21 (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse94 (store (let ((.cse97 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse96 (store .cse98 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse99 (store .cse81 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 .cse17 .cse97 .cse77)))) (store .cse99 .cse5 (+ (select (select (store .cse98 |c_ULTIMATE.start_main_~a~0#1.base| .cse99) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse81 .cse5)))) .cse11 v_ArrVal_690)))) (let ((.cse95 (store (select .cse96 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse6 .cse17 .cse97 1 .cse77)))) (store .cse95 .cse1 (+ (select (select (store .cse96 |c_ULTIMATE.start_main_~b~0#1.base| .cse95) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= .cse2 (select .cse94 .cse1)) (not (= .cse2 (select .cse94 |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse100 (store (let ((.cse103 (select .cse106 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse102 (store .cse104 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse105 (store .cse106 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 .cse17 .cse103)))) (store .cse105 .cse5 (+ (select .cse106 .cse5) (select (select (store .cse104 |c_ULTIMATE.start_main_~a~0#1.base| .cse105) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) .cse11 v_ArrVal_690)))) (let ((.cse101 (store (select .cse102 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse6 .cse17 .cse103 1)))) (store .cse101 .cse1 (+ (select (select (store .cse102 |c_ULTIMATE.start_main_~b~0#1.base| .cse101) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (= (select .cse100 .cse1) .cse2) (not (= .cse2 (select .cse100 |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) (forall ((v_ArrVal_697 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_690 Int)) (let ((.cse107 (store (let ((.cse110 (store .cse9 .cse111 v_ArrVal_690))) (let ((.cse109 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse110))) (let ((.cse108 (store (select .cse109 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse110 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse108 .cse1 (+ 1 (select (select (store .cse109 |c_ULTIMATE.start_main_~b~0#1.base| .cse108) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_697))) (or (not (= .cse2 (select .cse107 |c_ULTIMATE.start_main_~b~0#1.offset|))) (= .cse2 (select .cse107 .cse1)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_203|))))) (= |c_ULTIMATE.start_main_~i~0#1| 1))))))))))) is different from true