./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array7_pattern.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-patterns/array7_pattern.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 85b55cdd1f26353e63ecc189ba28ba899672edc569fe3ef3f04470f2b5e667fa --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:24:55,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:24:55,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:24:55,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:24:55,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:24:55,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:24:55,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:24:55,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:24:55,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:24:55,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:24:55,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:24:55,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:24:55,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:24:55,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:24:55,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:24:55,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:24:55,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:24:55,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:24:55,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:24:55,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:24:55,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:24:55,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:24:55,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:24:55,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:24:55,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:24:55,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:24:55,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:24:55,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:24:55,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:24:55,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:24:55,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:24:55,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:24:55,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:24:55,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:24:55,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:24:55,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:24:55,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:24:55,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:24:55,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:24:55,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:24:55,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:24:55,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:24:55,140 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:24:55,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:24:55,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:24:55,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:24:55,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:24:55,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:24:55,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:24:55,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:24:55,143 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:24:55,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:24:55,144 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:24:55,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:24:55,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:24:55,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:24:55,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:24:55,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:24:55,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:24:55,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:24:55,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:24:55,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:24:55,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:24:55,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:24:55,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:24:55,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:24:55,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:55,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:24:55,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:24:55,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:24:55,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:24:55,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:24:55,147 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:24:55,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:24:55,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:24:55,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85b55cdd1f26353e63ecc189ba28ba899672edc569fe3ef3f04470f2b5e667fa [2022-02-20 14:24:55,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:24:55,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:24:55,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:24:55,368 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:24:55,369 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:24:55,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array7_pattern.c [2022-02-20 14:24:55,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc73b0702/4f0152d0798642d4ad61b720ad341019/FLAGb1baf39e0 [2022-02-20 14:24:55,800 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:24:55,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c [2022-02-20 14:24:55,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc73b0702/4f0152d0798642d4ad61b720ad341019/FLAGb1baf39e0 [2022-02-20 14:24:56,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc73b0702/4f0152d0798642d4ad61b720ad341019 [2022-02-20 14:24:56,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:24:56,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:24:56,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:56,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:24:56,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:24:56,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfc1d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56, skipping insertion in model container [2022-02-20 14:24:56,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:24:56,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:24:56,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c[1375,1388] [2022-02-20 14:24:56,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:56,554 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:24:56,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c[1375,1388] [2022-02-20 14:24:56,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:56,617 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:24:56,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56 WrapperNode [2022-02-20 14:24:56,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:56,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:56,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:24:56,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:24:56,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,697 INFO L137 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2022-02-20 14:24:56,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:56,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:24:56,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:24:56,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:24:56,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:24:56,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:24:56,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:24:56,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:24:56,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:56,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:56,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:24:56,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:24:56,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:24:56,884 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:24:56,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:24:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:24:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:24:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:24:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:24:56,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:24:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:24:56,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:24:56,941 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:24:56,943 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:24:57,199 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:24:57,206 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:24:57,206 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:24:57,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:57 BoogieIcfgContainer [2022-02-20 14:24:57,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:24:57,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:24:57,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:24:57,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:24:57,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:24:56" (1/3) ... [2022-02-20 14:24:57,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62054a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:57, skipping insertion in model container [2022-02-20 14:24:57,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (2/3) ... [2022-02-20 14:24:57,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62054a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:57, skipping insertion in model container [2022-02-20 14:24:57,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:57" (3/3) ... [2022-02-20 14:24:57,216 INFO L111 eAbstractionObserver]: Analyzing ICFG array7_pattern.c [2022-02-20 14:24:57,220 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:24:57,220 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:24:57,260 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:24:57,266 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:24:57,266 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:24:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:24:57,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:57,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:57,290 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:57,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash -440982883, now seen corresponding path program 1 times [2022-02-20 14:24:57,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:57,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277735946] [2022-02-20 14:24:57,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:57,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:24:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:57,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} ~cond := #in~cond; {29#true} is VALID [2022-02-20 14:24:57,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume 0 == ~cond;assume false; {30#false} is VALID [2022-02-20 14:24:57,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 14:24:57,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#false} {29#true} #74#return; {30#false} is VALID [2022-02-20 14:24:57,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {29#true} is VALID [2022-02-20 14:24:57,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1, main_~pivot~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {29#true} is VALID [2022-02-20 14:24:57,474 INFO L272 TraceCheckUtils]: 2: Hoare triple {29#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {29#true} is VALID [2022-02-20 14:24:57,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#true} ~cond := #in~cond; {29#true} is VALID [2022-02-20 14:24:57,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#true} assume 0 == ~cond;assume false; {30#false} is VALID [2022-02-20 14:24:57,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume true; {30#false} is VALID [2022-02-20 14:24:57,475 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30#false} {29#true} #74#return; {30#false} is VALID [2022-02-20 14:24:57,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;havoc main_~pivot~0#1;main_~count~0#1 := 0; {30#false} is VALID [2022-02-20 14:24:57,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-02-20 14:24:57,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-02-20 14:24:57,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} main_~count~0#1 := 0; {30#false} is VALID [2022-02-20 14:24:57,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-02-20 14:24:57,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {30#false} is VALID [2022-02-20 14:24:57,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {30#false} assume 0 == __VERIFIER_assert_~cond#1; {30#false} is VALID [2022-02-20 14:24:57,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 14:24:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:24:57,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:57,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277735946] [2022-02-20 14:24:57,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277735946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:57,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:57,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:24:57,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277142711] [2022-02-20 14:24:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:57,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:24:57,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:57,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:57,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:57,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:24:57,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:57,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:24:57,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:57,564 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,615 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2022-02-20 14:24:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:24:57,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:24:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2022-02-20 14:24:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2022-02-20 14:24:57,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2022-02-20 14:24:57,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:57,693 INFO L225 Difference]: With dead ends: 49 [2022-02-20 14:24:57,693 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 14:24:57,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:57,697 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:57,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 14:24:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 14:24:57,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:57,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:57,718 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:57,718 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:57,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,721 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 14:24:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 14:24:57,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 14:24:57,722 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 14:24:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,725 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 14:24:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 14:24:57,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:57,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 14:24:57,729 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-02-20 14:24:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:57,729 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 14:24:57,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 14:24:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:24:57,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:57,730 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:57,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:24:57,731 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:57,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1396045698, now seen corresponding path program 1 times [2022-02-20 14:24:57,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:57,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592086504] [2022-02-20 14:24:57,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:57,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:57,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:24:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:57,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-02-20 14:24:57,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-02-20 14:24:57,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-02-20 14:24:57,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #74#return; {171#true} is VALID [2022-02-20 14:24:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 14:24:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:57,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-02-20 14:24:57,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-02-20 14:24:57,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-02-20 14:24:57,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} #76#return; {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 14:24:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:57,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-02-20 14:24:57,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-02-20 14:24:57,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-02-20 14:24:57,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} #78#return; {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {171#true} is VALID [2022-02-20 14:24:57,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1, main_~pivot~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {171#true} is VALID [2022-02-20 14:24:57,855 INFO L272 TraceCheckUtils]: 2: Hoare triple {171#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {171#true} is VALID [2022-02-20 14:24:57,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-02-20 14:24:57,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-02-20 14:24:57,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} assume true; {171#true} is VALID [2022-02-20 14:24:57,856 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {171#true} {171#true} #74#return; {171#true} is VALID [2022-02-20 14:24:57,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {171#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;havoc main_~pivot~0#1;main_~count~0#1 := 0; {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~pivot~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,857 INFO L272 TraceCheckUtils]: 10: Hoare triple {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} call assume_abort_if_not((if main_~pivot~0#1 > 0 then 1 else 0)); {171#true} is VALID [2022-02-20 14:24:57,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-02-20 14:24:57,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-02-20 14:24:57,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {171#true} assume true; {171#true} is VALID [2022-02-20 14:24:57,859 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {171#true} {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} #76#return; {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,859 INFO L272 TraceCheckUtils]: 15: Hoare triple {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} call assume_abort_if_not((if main_~index~0#1 >= main_~pivot~0#1 && main_~index~0#1 < ~ARR_SIZE~0 - main_~pivot~0#1 then 1 else 0)); {171#true} is VALID [2022-02-20 14:24:57,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {171#true} ~cond := #in~cond; {171#true} is VALID [2022-02-20 14:24:57,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {171#true} assume !(0 == ~cond); {171#true} is VALID [2022-02-20 14:24:57,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {171#true} assume true; {171#true} is VALID [2022-02-20 14:24:57,860 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {171#true} {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} #78#return; {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem9#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume 0 == main_~temp~0#1; {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_~count~0#1 := 0; {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:57,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {177#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {186#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:24:57,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {186#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {172#false} is VALID [2022-02-20 14:24:57,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-02-20 14:24:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:24:57,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:57,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592086504] [2022-02-20 14:24:57,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592086504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:57,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:57,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:24:57,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503361794] [2022-02-20 14:24:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:57,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 14:24:57,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:57,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:57,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:57,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:24:57,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:57,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:24:57,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:57,887 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,986 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 14:24:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 14:24:57,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-02-20 14:24:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-02-20 14:24:57,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-02-20 14:24:58,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:58,017 INFO L225 Difference]: With dead ends: 27 [2022-02-20 14:24:58,017 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 14:24:58,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:58,018 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:58,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 14:24:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 14:24:58,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:58,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:58,022 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:58,023 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,024 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 14:24:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:24:58,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:58,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:58,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 14:24:58,025 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 14:24:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,027 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 14:24:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:24:58,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:58,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:58,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:58,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 14:24:58,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 27 [2022-02-20 14:24:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:58,030 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 14:24:58,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:24:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:24:58,031 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:58,031 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:58,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:24:58,031 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1623352868, now seen corresponding path program 1 times [2022-02-20 14:24:58,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:58,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067601307] [2022-02-20 14:24:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:58,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:24:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-02-20 14:24:58,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-02-20 14:24:58,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-02-20 14:24:58,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #74#return; {301#true} is VALID [2022-02-20 14:24:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 14:24:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-02-20 14:24:58,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-02-20 14:24:58,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-02-20 14:24:58,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {308#(<= ~ARR_SIZE~0 0)} #76#return; {308#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 14:24:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-02-20 14:24:58,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-02-20 14:24:58,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-02-20 14:24:58,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {308#(<= ~ARR_SIZE~0 0)} #78#return; {308#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:58,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {301#true} is VALID [2022-02-20 14:24:58,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1, main_~pivot~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {301#true} is VALID [2022-02-20 14:24:58,168 INFO L272 TraceCheckUtils]: 2: Hoare triple {301#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {301#true} is VALID [2022-02-20 14:24:58,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-02-20 14:24:58,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-02-20 14:24:58,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} assume true; {301#true} is VALID [2022-02-20 14:24:58,169 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {301#true} {301#true} #74#return; {301#true} is VALID [2022-02-20 14:24:58,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;havoc main_~pivot~0#1;main_~count~0#1 := 0; {307#(= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:58,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#(= |ULTIMATE.start_main_~count~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {308#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:58,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {308#(<= ~ARR_SIZE~0 0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~pivot~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {308#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:58,170 INFO L272 TraceCheckUtils]: 10: Hoare triple {308#(<= ~ARR_SIZE~0 0)} call assume_abort_if_not((if main_~pivot~0#1 > 0 then 1 else 0)); {301#true} is VALID [2022-02-20 14:24:58,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-02-20 14:24:58,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-02-20 14:24:58,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {301#true} assume true; {301#true} is VALID [2022-02-20 14:24:58,172 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {301#true} {308#(<= ~ARR_SIZE~0 0)} #76#return; {308#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:58,172 INFO L272 TraceCheckUtils]: 15: Hoare triple {308#(<= ~ARR_SIZE~0 0)} call assume_abort_if_not((if main_~index~0#1 >= main_~pivot~0#1 && main_~index~0#1 < ~ARR_SIZE~0 - main_~pivot~0#1 then 1 else 0)); {301#true} is VALID [2022-02-20 14:24:58,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-02-20 14:24:58,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-02-20 14:24:58,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {301#true} assume true; {301#true} is VALID [2022-02-20 14:24:58,173 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {301#true} {308#(<= ~ARR_SIZE~0 0)} #78#return; {308#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:58,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#(<= ~ARR_SIZE~0 0)} call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem9#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {308#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:58,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#(<= ~ARR_SIZE~0 0)} assume 0 == main_~temp~0#1; {308#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:58,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#(<= ~ARR_SIZE~0 0)} main_~count~0#1 := 0; {317#(and (= |ULTIMATE.start_main_~count~0#1| 0) (<= ~ARR_SIZE~0 0))} is VALID [2022-02-20 14:24:58,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {317#(and (= |ULTIMATE.start_main_~count~0#1| 0) (<= ~ARR_SIZE~0 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem15#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1 + main_#t~mem15#1;havoc main_#t~mem14#1;havoc main_#t~mem15#1; {302#false} is VALID [2022-02-20 14:24:58,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {302#false} main_#t~post13#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {302#false} is VALID [2022-02-20 14:24:58,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {302#false} is VALID [2022-02-20 14:24:58,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {302#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {302#false} is VALID [2022-02-20 14:24:58,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {302#false} assume 0 == __VERIFIER_assert_~cond#1; {302#false} is VALID [2022-02-20 14:24:58,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-02-20 14:24:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:24:58,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:58,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067601307] [2022-02-20 14:24:58,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067601307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:58,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:58,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:24:58,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715330373] [2022-02-20 14:24:58,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:58,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 14:24:58,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:58,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:58,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:58,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:24:58,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:58,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:24:58,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:58,197 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,304 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-02-20 14:24:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:24:58,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 14:24:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-02-20 14:24:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-02-20 14:24:58,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-02-20 14:24:58,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:58,350 INFO L225 Difference]: With dead ends: 43 [2022-02-20 14:24:58,350 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:24:58,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:58,351 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:58,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:24:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-02-20 14:24:58,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:58,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:58,355 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:58,355 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,356 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 14:24:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-02-20 14:24:58,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:58,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:58,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 14:24:58,357 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 14:24:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,358 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 14:24:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-02-20 14:24:58,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:58,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:58,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:58,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-02-20 14:24:58,361 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-02-20 14:24:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:58,361 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-20 14:24:58,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:24:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:24:58,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:58,362 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:58,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:24:58,362 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1083978846, now seen corresponding path program 1 times [2022-02-20 14:24:58,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:58,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169001587] [2022-02-20 14:24:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:58,382 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:58,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394016277] [2022-02-20 14:24:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:58,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:58,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:58,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:24:58,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:24:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 14:24:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:58,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {460#true} is VALID [2022-02-20 14:24:58,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1, main_~pivot~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {460#true} is VALID [2022-02-20 14:24:58,864 INFO L272 TraceCheckUtils]: 2: Hoare triple {460#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {460#true} is VALID [2022-02-20 14:24:58,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-02-20 14:24:58,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-02-20 14:24:58,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 14:24:58,866 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {460#true} {460#true} #74#return; {460#true} is VALID [2022-02-20 14:24:58,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;havoc main_~pivot~0#1;main_~count~0#1 := 0; {486#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:58,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {486#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {486#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:58,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {486#(<= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {493#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:58,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {493#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {497#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:24:58,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~pivot~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {497#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:24:58,870 INFO L272 TraceCheckUtils]: 12: Hoare triple {497#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~pivot~0#1 > 0 then 1 else 0)); {497#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:24:58,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {497#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {507#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:24:58,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {511#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:24:58,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {511#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {511#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:24:58,872 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {511#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} {497#(<= ~ARR_SIZE~0 1)} #76#return; {518#(and (< 0 |ULTIMATE.start_main_~pivot~0#1|) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:24:58,873 INFO L272 TraceCheckUtils]: 17: Hoare triple {518#(and (< 0 |ULTIMATE.start_main_~pivot~0#1|) (<= ~ARR_SIZE~0 1))} call assume_abort_if_not((if main_~index~0#1 >= main_~pivot~0#1 && main_~index~0#1 < ~ARR_SIZE~0 - main_~pivot~0#1 then 1 else 0)); {497#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:24:58,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {497#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {507#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:24:58,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {507#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {511#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:24:58,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {511#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {511#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:24:58,875 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {511#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} {518#(and (< 0 |ULTIMATE.start_main_~pivot~0#1|) (<= ~ARR_SIZE~0 1))} #78#return; {461#false} is VALID [2022-02-20 14:24:58,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#false} call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem9#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {461#false} is VALID [2022-02-20 14:24:58,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {461#false} assume 0 == main_~temp~0#1; {461#false} is VALID [2022-02-20 14:24:58,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {461#false} main_~count~0#1 := 0; {461#false} is VALID [2022-02-20 14:24:58,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {461#false} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem15#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1 + main_#t~mem15#1;havoc main_#t~mem14#1;havoc main_#t~mem15#1; {461#false} is VALID [2022-02-20 14:24:58,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {461#false} main_#t~post13#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {461#false} is VALID [2022-02-20 14:24:58,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {461#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {461#false} is VALID [2022-02-20 14:24:58,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {461#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {461#false} is VALID [2022-02-20 14:24:58,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {461#false} assume 0 == __VERIFIER_assert_~cond#1; {461#false} is VALID [2022-02-20 14:24:58,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 14:24:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:24:58,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:59,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 14:24:59,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {461#false} assume 0 == __VERIFIER_assert_~cond#1; {461#false} is VALID [2022-02-20 14:24:59,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {461#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {461#false} is VALID [2022-02-20 14:24:59,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {461#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {461#false} is VALID [2022-02-20 14:24:59,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {461#false} main_#t~post13#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {461#false} is VALID [2022-02-20 14:24:59,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {461#false} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem15#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1 + main_#t~mem15#1;havoc main_#t~mem14#1;havoc main_#t~mem15#1; {461#false} is VALID [2022-02-20 14:24:59,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {461#false} main_~count~0#1 := 0; {461#false} is VALID [2022-02-20 14:24:59,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {461#false} assume 0 == main_~temp~0#1; {461#false} is VALID [2022-02-20 14:24:59,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#false} call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem9#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {461#false} is VALID [2022-02-20 14:24:59,684 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {592#(not (= |assume_abort_if_not_#in~cond| 0))} {588#(<= ~ARR_SIZE~0 (* 2 |ULTIMATE.start_main_~pivot~0#1|))} #78#return; {461#false} is VALID [2022-02-20 14:24:59,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {592#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:24:59,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {599#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:24:59,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#true} ~cond := #in~cond; {599#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:24:59,686 INFO L272 TraceCheckUtils]: 17: Hoare triple {588#(<= ~ARR_SIZE~0 (* 2 |ULTIMATE.start_main_~pivot~0#1|))} call assume_abort_if_not((if main_~index~0#1 >= main_~pivot~0#1 && main_~index~0#1 < ~ARR_SIZE~0 - main_~pivot~0#1 then 1 else 0)); {460#true} is VALID [2022-02-20 14:24:59,687 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {610#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= (div (- ~ARR_SIZE~0) (- 2)) 1)))} {606#(<= (div (- ~ARR_SIZE~0) (- 2)) 1)} #76#return; {588#(<= ~ARR_SIZE~0 (* 2 |ULTIMATE.start_main_~pivot~0#1|))} is VALID [2022-02-20 14:24:59,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= (div (- ~ARR_SIZE~0) (- 2)) 1)))} assume true; {610#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= (div (- ~ARR_SIZE~0) (- 2)) 1)))} is VALID [2022-02-20 14:24:59,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {617#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= (div (- ~ARR_SIZE~0) (- 2)) 1)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {610#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= (div (- ~ARR_SIZE~0) (- 2)) 1)))} is VALID [2022-02-20 14:24:59,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#true} ~cond := #in~cond; {617#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= (div (- ~ARR_SIZE~0) (- 2)) 1)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:24:59,689 INFO L272 TraceCheckUtils]: 12: Hoare triple {606#(<= (div (- ~ARR_SIZE~0) (- 2)) 1)} call assume_abort_if_not((if main_~pivot~0#1 > 0 then 1 else 0)); {460#true} is VALID [2022-02-20 14:24:59,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {606#(<= (div (- ~ARR_SIZE~0) (- 2)) 1)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~pivot~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {606#(<= (div (- ~ARR_SIZE~0) (- 2)) 1)} is VALID [2022-02-20 14:24:59,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {627#(<= (div (+ (- 2) (* (- 1) |ULTIMATE.start_main_~count~0#1|)) (- 2)) 2)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {606#(<= (div (- ~ARR_SIZE~0) (- 2)) 1)} is VALID [2022-02-20 14:24:59,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {493#(<= |ULTIMATE.start_main_~count~0#1| 1)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {627#(<= (div (+ (- 2) (* (- 1) |ULTIMATE.start_main_~count~0#1|)) (- 2)) 2)} is VALID [2022-02-20 14:24:59,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {493#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {493#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:59,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;havoc main_~pivot~0#1;main_~count~0#1 := 0; {493#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:59,692 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {460#true} {460#true} #74#return; {460#true} is VALID [2022-02-20 14:24:59,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 14:24:59,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-02-20 14:24:59,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-02-20 14:24:59,693 INFO L272 TraceCheckUtils]: 2: Hoare triple {460#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {460#true} is VALID [2022-02-20 14:24:59,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1, main_~pivot~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {460#true} is VALID [2022-02-20 14:24:59,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {460#true} is VALID [2022-02-20 14:24:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:24:59,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:59,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169001587] [2022-02-20 14:24:59,695 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:59,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394016277] [2022-02-20 14:24:59,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394016277] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:59,695 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:59,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2022-02-20 14:24:59,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638179140] [2022-02-20 14:24:59,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:59,697 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 31 [2022-02-20 14:24:59,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:59,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:24:59,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:59,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:24:59,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:59,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:24:59,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:24:59,741 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:25:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:00,264 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-02-20 14:25:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 14:25:00,265 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 31 [2022-02-20 14:25:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:25:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-02-20 14:25:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:25:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-02-20 14:25:00,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-02-20 14:25:00,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:00,381 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:25:00,381 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 14:25:00,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-02-20 14:25:00,382 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:00,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 111 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 14:25:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2022-02-20 14:25:00,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:00,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:00,388 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:00,389 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:00,390 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 14:25:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 14:25:00,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:00,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:00,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 42 states. [2022-02-20 14:25:00,391 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 42 states. [2022-02-20 14:25:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:00,392 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 14:25:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 14:25:00,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:00,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:00,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:00,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-02-20 14:25:00,394 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 31 [2022-02-20 14:25:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:00,394 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-20 14:25:00,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:25:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 14:25:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:25:00,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:00,395 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:00,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:00,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:00,596 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1214758882, now seen corresponding path program 2 times [2022-02-20 14:25:00,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:00,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916629469] [2022-02-20 14:25:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:00,614 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:00,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873860074] [2022-02-20 14:25:00,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:25:00,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:00,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:00,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:00,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:25:00,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:25:00,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:00,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:25:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:00,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:00,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {889#true} is VALID [2022-02-20 14:25:00,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1, main_~pivot~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {889#true} is VALID [2022-02-20 14:25:00,923 INFO L272 TraceCheckUtils]: 2: Hoare triple {889#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {889#true} is VALID [2022-02-20 14:25:00,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {889#true} ~cond := #in~cond; {889#true} is VALID [2022-02-20 14:25:00,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {889#true} assume !(0 == ~cond); {889#true} is VALID [2022-02-20 14:25:00,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {889#true} assume true; {889#true} is VALID [2022-02-20 14:25:00,923 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {889#true} {889#true} #74#return; {889#true} is VALID [2022-02-20 14:25:00,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {889#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;havoc main_~pivot~0#1;main_~count~0#1 := 0; {915#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:00,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {915#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {915#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:00,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {915#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {922#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:00,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {922#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {922#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:00,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {922#(<= 1 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {929#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:00,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {929#(<= 2 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {933#(< 2 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(< 2 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#(< 2 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~pivot~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,928 INFO L272 TraceCheckUtils]: 16: Hoare triple {933#(< 2 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~pivot~0#1 > 0 then 1 else 0)); {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {933#(< 2 ~ARR_SIZE~0)} ~cond := #in~cond; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {933#(< 2 ~ARR_SIZE~0)} assume !(0 == ~cond); {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {933#(< 2 ~ARR_SIZE~0)} assume true; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,930 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {933#(< 2 ~ARR_SIZE~0)} {933#(< 2 ~ARR_SIZE~0)} #76#return; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,931 INFO L272 TraceCheckUtils]: 21: Hoare triple {933#(< 2 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 >= main_~pivot~0#1 && main_~index~0#1 < ~ARR_SIZE~0 - main_~pivot~0#1 then 1 else 0)); {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {933#(< 2 ~ARR_SIZE~0)} ~cond := #in~cond; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {933#(< 2 ~ARR_SIZE~0)} assume !(0 == ~cond); {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {933#(< 2 ~ARR_SIZE~0)} assume true; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,933 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {933#(< 2 ~ARR_SIZE~0)} {933#(< 2 ~ARR_SIZE~0)} #78#return; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {933#(< 2 ~ARR_SIZE~0)} call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem9#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {933#(< 2 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {933#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:00,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {933#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 0; {982#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:00,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {982#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem15#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1 + main_#t~mem15#1;havoc main_#t~mem14#1;havoc main_#t~mem15#1; {982#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:00,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {982#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} main_#t~post13#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {989#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:00,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {989#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {890#false} is VALID [2022-02-20 14:25:00,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {890#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {890#false} is VALID [2022-02-20 14:25:00,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {890#false} assume 0 == __VERIFIER_assert_~cond#1; {890#false} is VALID [2022-02-20 14:25:00,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {890#false} assume !false; {890#false} is VALID [2022-02-20 14:25:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:25:00,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:01,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {890#false} assume !false; {890#false} is VALID [2022-02-20 14:25:01,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {890#false} assume 0 == __VERIFIER_assert_~cond#1; {890#false} is VALID [2022-02-20 14:25:01,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {890#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {890#false} is VALID [2022-02-20 14:25:01,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {1011#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {890#false} is VALID [2022-02-20 14:25:01,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {1015#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} main_#t~post13#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1011#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {1015#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem15#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1 + main_#t~mem15#1;havoc main_#t~mem14#1;havoc main_#t~mem15#1; {1015#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {1022#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 0; {1015#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {1022#(< 1 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {1022#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {1022#(< 1 ~ARR_SIZE~0)} call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem9#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 - main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 - main_~pivot~0#1) % 4294967296 else (main_~index~0#1 - main_~pivot~0#1) % 4294967296 - 4294967296), 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if (main_~index~0#1 + main_~pivot~0#1) % 4294967296 <= 2147483647 then (main_~index~0#1 + main_~pivot~0#1) % 4294967296 else (main_~index~0#1 + main_~pivot~0#1) % 4294967296 - 4294967296), 4);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1022#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,184 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {889#true} {1022#(< 1 ~ARR_SIZE~0)} #78#return; {1022#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {889#true} assume true; {889#true} is VALID [2022-02-20 14:25:01,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {889#true} assume !(0 == ~cond); {889#true} is VALID [2022-02-20 14:25:01,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {889#true} ~cond := #in~cond; {889#true} is VALID [2022-02-20 14:25:01,185 INFO L272 TraceCheckUtils]: 21: Hoare triple {1022#(< 1 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 >= main_~pivot~0#1 && main_~index~0#1 < ~ARR_SIZE~0 - main_~pivot~0#1 then 1 else 0)); {889#true} is VALID [2022-02-20 14:25:01,196 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {889#true} {1022#(< 1 ~ARR_SIZE~0)} #76#return; {1022#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {889#true} assume true; {889#true} is VALID [2022-02-20 14:25:01,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {889#true} assume !(0 == ~cond); {889#true} is VALID [2022-02-20 14:25:01,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {889#true} ~cond := #in~cond; {889#true} is VALID [2022-02-20 14:25:01,197 INFO L272 TraceCheckUtils]: 16: Hoare triple {1022#(< 1 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~pivot~0#1 > 0 then 1 else 0)); {889#true} is VALID [2022-02-20 14:25:01,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {1022#(< 1 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~pivot~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1022#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {1022#(< 1 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1022#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {1022#(< 1 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1022#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {922#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1022#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:01,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {915#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {922#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:01,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {915#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {915#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:01,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {1080#(<= 0 (+ |ULTIMATE.start_main_~count~0#1| 1))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {915#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:01,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {1080#(<= 0 (+ |ULTIMATE.start_main_~count~0#1| 1))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1080#(<= 0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:01,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {889#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;havoc main_~pivot~0#1;main_~count~0#1 := 0; {1080#(<= 0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:01,202 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {889#true} {889#true} #74#return; {889#true} is VALID [2022-02-20 14:25:01,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {889#true} assume true; {889#true} is VALID [2022-02-20 14:25:01,202 INFO L290 TraceCheckUtils]: 4: Hoare triple {889#true} assume !(0 == ~cond); {889#true} is VALID [2022-02-20 14:25:01,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {889#true} ~cond := #in~cond; {889#true} is VALID [2022-02-20 14:25:01,202 INFO L272 TraceCheckUtils]: 2: Hoare triple {889#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {889#true} is VALID [2022-02-20 14:25:01,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1, main_~pivot~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {889#true} is VALID [2022-02-20 14:25:01,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {889#true} is VALID [2022-02-20 14:25:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:25:01,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:01,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916629469] [2022-02-20 14:25:01,203 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:01,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873860074] [2022-02-20 14:25:01,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873860074] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:01,203 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:01,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-02-20 14:25:01,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921091550] [2022-02-20 14:25:01,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:01,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-02-20 14:25:01,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:01,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:25:01,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:01,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:25:01,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:01,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:25:01,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:25:01,258 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:25:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:01,646 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-20 14:25:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:25:01,647 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-02-20 14:25:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:25:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-02-20 14:25:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:25:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-02-20 14:25:01,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-02-20 14:25:01,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:01,681 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:25:01,682 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:25:01,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:25:01,683 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 67 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:01,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 82 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:25:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 14:25:01,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:01,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,699 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,699 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:01,701 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 14:25:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 14:25:01,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:01,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:01,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-02-20 14:25:01,702 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-02-20 14:25:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:01,704 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 14:25:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 14:25:01,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:01,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:01,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:01,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-02-20 14:25:01,706 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 35 [2022-02-20 14:25:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:01,707 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-02-20 14:25:01,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:25:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 14:25:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:25:01,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:01,709 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:01,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:01,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:01,914 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:01,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1618850078, now seen corresponding path program 3 times [2022-02-20 14:25:01,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:01,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417590017] [2022-02-20 14:25:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:01,942 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:01,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765745463] [2022-02-20 14:25:01,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:25:01,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:01,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:01,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:01,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:25:02,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:25:02,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:02,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 86 conjunts are in the unsatisfiable core [2022-02-20 14:25:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:02,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:02,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 14:25:02,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:02,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-02-20 14:25:02,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 15 [2022-02-20 14:25:02,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-02-20 14:25:02,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:02,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2022-02-20 14:25:02,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:02,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 22 [2022-02-20 14:25:02,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:02,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:02,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 [2022-02-20 14:25:02,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:02,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2022-02-20 14:25:02,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:02,726 INFO L356 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2022-02-20 14:25:02,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 34 [2022-02-20 14:25:02,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:02,757 INFO L356 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-02-20 14:25:02,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 60 [2022-02-20 14:25:07,441 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 14:25:07,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1182 treesize of output 1097 [2022-02-20 14:25:07,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,952 INFO L244 Elim1Store]: Index analysis took 330 ms [2022-02-20 14:25:07,975 INFO L356 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-02-20 14:25:07,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 26 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 431 treesize of output 518 [2022-02-20 14:25:08,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:08,544 INFO L244 Elim1Store]: Index analysis took 260 ms [2022-02-20 14:25:08,624 INFO L356 Elim1Store]: treesize reduction 175, result has 0.6 percent of original size [2022-02-20 14:25:08,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 6 stores, 7 select indices, 7 select index equivalence classes, 32 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 6 case distinctions, treesize of input 667 treesize of output 1321