./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array10_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array10_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 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 09:41:16,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 09:41:16,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 09:41:16,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 09:41:16,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 09:41:16,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 09:41:16,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 09:41:16,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 09:41:16,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 09:41:16,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 09:41:16,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 09:41:16,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 09:41:16,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 09:41:16,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 09:41:16,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 09:41:16,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 09:41:16,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 09:41:16,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 09:41:16,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 09:41:16,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 09:41:16,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 09:41:16,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 09:41:16,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 09:41:16,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 09:41:17,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 09:41:17,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 09:41:17,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 09:41:17,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 09:41:17,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 09:41:17,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 09:41:17,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 09:41:17,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 09:41:17,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 09:41:17,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 09:41:17,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 09:41:17,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 09:41:17,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 09:41:17,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 09:41:17,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 09:41:17,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 09:41:17,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 09:41:17,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 09:41:17,038 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 09:41:17,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 09:41:17,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 09:41:17,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 09:41:17,039 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 09:41:17,039 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 09:41:17,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 09:41:17,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 09:41:17,040 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 09:41:17,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 09:41:17,041 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 09:41:17,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 09:41:17,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 09:41:17,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 09:41:17,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 09:41:17,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 09:41:17,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 09:41:17,042 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 09:41:17,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 09:41:17,042 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 09:41:17,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 09:41:17,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 09:41:17,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 09:41:17,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 09:41:17,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 09:41:17,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 09:41:17,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 09:41:17,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 09:41:17,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 09:41:17,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 09:41:17,044 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 09:41:17,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 09:41:17,044 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 09:41:17,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 09:41:17,045 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 09:41:17,045 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f [2023-02-15 09:41:17,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 09:41:17,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 09:41:17,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 09:41:17,275 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 09:41:17,275 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 09:41:17,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array10_pattern.c [2023-02-15 09:41:18,313 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 09:41:18,560 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 09:41:18,560 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c [2023-02-15 09:41:18,566 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e4185c8/d33927713b9c4c6badfdfa5ef5ec3a8e/FLAGabf9e7f77 [2023-02-15 09:41:18,935 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e4185c8/d33927713b9c4c6badfdfa5ef5ec3a8e [2023-02-15 09:41:18,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 09:41:18,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 09:41:18,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 09:41:18,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 09:41:18,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 09:41:18,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:41:18" (1/1) ... [2023-02-15 09:41:18,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a3edcc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:18, skipping insertion in model container [2023-02-15 09:41:18,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:41:18" (1/1) ... [2023-02-15 09:41:18,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 09:41:18,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 09:41:19,084 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2023-02-15 09:41:19,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 09:41:19,120 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 09:41:19,132 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2023-02-15 09:41:19,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 09:41:19,153 INFO L208 MainTranslator]: Completed translation [2023-02-15 09:41:19,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19 WrapperNode [2023-02-15 09:41:19,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 09:41:19,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 09:41:19,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 09:41:19,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 09:41:19,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,180 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2023-02-15 09:41:19,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 09:41:19,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 09:41:19,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 09:41:19,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 09:41:19,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,198 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 09:41:19,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 09:41:19,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 09:41:19,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 09:41:19,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (1/1) ... [2023-02-15 09:41:19,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 09:41:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:41:19,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 09:41:19,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 09:41:19,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 09:41:19,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 09:41:19,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 09:41:19,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 09:41:19,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 09:41:19,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 09:41:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 09:41:19,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 09:41:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 09:41:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 09:41:19,345 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 09:41:19,347 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 09:41:19,523 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 09:41:19,528 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 09:41:19,528 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 09:41:19,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:41:19 BoogieIcfgContainer [2023-02-15 09:41:19,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 09:41:19,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 09:41:19,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 09:41:19,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 09:41:19,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:41:18" (1/3) ... [2023-02-15 09:41:19,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0cbc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:41:19, skipping insertion in model container [2023-02-15 09:41:19,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:41:19" (2/3) ... [2023-02-15 09:41:19,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0cbc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:41:19, skipping insertion in model container [2023-02-15 09:41:19,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:41:19" (3/3) ... [2023-02-15 09:41:19,557 INFO L112 eAbstractionObserver]: Analyzing ICFG array10_pattern.c [2023-02-15 09:41:19,580 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 09:41:19,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 09:41:19,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 09:41:19,619 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e648e14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 09:41:19,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 09:41:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:41:19,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 09:41:19,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:41:19,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:41:19,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:41:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:41:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1199380475, now seen corresponding path program 1 times [2023-02-15 09:41:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:41:19,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817430513] [2023-02-15 09:41:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:41:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:41:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:41:19,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:41:19,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817430513] [2023-02-15 09:41:19,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 09:41:19,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749830592] [2023-02-15 09:41:19,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:41:19,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:41:19,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:41:19,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 09:41:19,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 09:41:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:41:19,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 09:41:19,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:41:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 09:41:19,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 09:41:19,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749830592] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 09:41:19,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 09:41:19,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 09:41:19,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788431204] [2023-02-15 09:41:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 09:41:19,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 09:41:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:41:19,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 09:41:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 09:41:19,913 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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) [2023-02-15 09:41:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:41:19,939 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2023-02-15 09:41:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 09:41:19,941 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 [2023-02-15 09:41:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:41:19,946 INFO L225 Difference]: With dead ends: 51 [2023-02-15 09:41:19,946 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 09:41:19,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 09:41:19,951 INFO L413 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 09:41:19,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 09:41:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 09:41:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 09:41:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:41:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 09:41:19,989 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2023-02-15 09:41:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:41:19,990 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 09:41:19,990 INFO L496 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) [2023-02-15 09:41:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 09:41:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 09:41:19,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:41:19,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:41:19,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 09:41:20,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 09:41:20,198 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:41:20,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:41:20,198 INFO L85 PathProgramCache]: Analyzing trace with hash 966180883, now seen corresponding path program 1 times [2023-02-15 09:41:20,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:41:20,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364138856] [2023-02-15 09:41:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:41:20,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:41:20,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:41:20,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556286210] [2023-02-15 09:41:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:41:20,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:41:20,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:41:20,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 09:41:20,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 09:41:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:41:20,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 09:41:20,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:41:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 09:41:20,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 09:41:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:41:20,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364138856] [2023-02-15 09:41:20,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 09:41:20,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556286210] [2023-02-15 09:41:20,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556286210] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 09:41:20,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 09:41:20,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 09:41:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789876091] [2023-02-15 09:41:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 09:41:20,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 09:41:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:41:20,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 09:41:20,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 09:41:20,418 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:41:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:41:20,515 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2023-02-15 09:41:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 09:41:20,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-15 09:41:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:41:20,517 INFO L225 Difference]: With dead ends: 48 [2023-02-15 09:41:20,517 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 09:41:20,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-15 09:41:20,520 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 09:41:20,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 56 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 09:41:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 09:41:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-15 09:41:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:41:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-02-15 09:41:20,534 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2023-02-15 09:41:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:41:20,535 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-02-15 09:41:20,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:41:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-02-15 09:41:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 09:41:20,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:41:20,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:41:20,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 09:41:20,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-15 09:41:20,742 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:41:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:41:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash -760544265, now seen corresponding path program 1 times [2023-02-15 09:41:20,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:41:20,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313249981] [2023-02-15 09:41:20,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:41:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:41:20,787 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:41:20,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829341624] [2023-02-15 09:41:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:41:20,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:41:20,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:41:20,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 09:41:20,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 09:41:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:41:20,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-15 09:41:20,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:41:20,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 09:41:21,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:21,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2023-02-15 09:41:21,031 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2023-02-15 09:41:21,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-15 09:41:21,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2023-02-15 09:41:21,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:21,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:41:21,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 101 [2023-02-15 09:41:21,524 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 09:41:21,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 122 [2023-02-15 09:41:21,706 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:41:21,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:21,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 107 treesize of output 127 [2023-02-15 09:41:21,915 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:41:21,916 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:41:21,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 12 [2023-02-15 09:41:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 09:41:21,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 09:41:47,374 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse40 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse0 (<= .cse40 2147483647)) (.cse39 (* .cse40 4)) (.cse9 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse24 (<= .cse9 2147483647)) (.cse5 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39)) (.cse8 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse39)) (.cse14 (not .cse0)) (.cse2 (* |c_ULTIMATE.start_main_~sum~0#1| 4)) (.cse6 (* c_~ARR_SIZE~0 c_~ARR_SIZE~0)) (.cse19 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse39))) (and (or (and (or .cse0 (and (forall ((v_ArrVal_67 Int)) (or (forall ((v_ArrVal_68 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse8 v_ArrVal_67)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (or (< (let ((.cse1 (store .cse4 .cse5 v_ArrVal_68))) (+ (* (select .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse2 (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse1) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse6) (not (<= (+ 4294967296 v_ArrVal_68) (mod (select .cse4 .cse5) 4294967296))))))) (not (<= v_ArrVal_67 .cse9)))) (forall ((v_ArrVal_67 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse8 v_ArrVal_67)))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse13 (mod (select .cse12 .cse5) 4294967296))) (or (forall ((v_ArrVal_68 Int)) (or (< (let ((.cse10 (store .cse12 .cse5 v_ArrVal_68))) (+ (* (select .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse2 (* (select (select (store .cse11 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse10) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse6) (not (<= v_ArrVal_68 .cse13)))) (not (<= .cse13 2147483647)) (not (<= v_ArrVal_67 .cse9))))))))) (or .cse14 (and (forall ((v_ArrVal_67 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse20 v_ArrVal_67)))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse15 (mod (select .cse18 .cse19) 4294967296))) (or (not (<= .cse15 2147483647)) (not (<= v_ArrVal_67 .cse9)) (forall ((v_ArrVal_68 Int)) (or (< (let ((.cse16 (store .cse18 .cse19 v_ArrVal_68))) (+ .cse2 (* (select .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* (select (select (store .cse17 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse16) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse6) (not (<= v_ArrVal_68 .cse15))))))))) (forall ((v_ArrVal_67 Int)) (or (not (<= v_ArrVal_67 .cse9)) (forall ((v_ArrVal_68 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse20 v_ArrVal_67)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (or (< (let ((.cse21 (store .cse23 .cse19 v_ArrVal_68))) (+ .cse2 (* (select .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* (select (select (store .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse21) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse6) (not (<= (+ 4294967296 v_ArrVal_68) (mod (select .cse23 .cse19) 4294967296)))))))))))) (not .cse24)) (or .cse24 (and (or .cse0 (and (forall ((v_ArrVal_67 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse8 v_ArrVal_67)))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse28 (mod (select .cse27 .cse5) 4294967296))) (or (forall ((v_ArrVal_68 Int)) (or (< (let ((.cse25 (store .cse27 .cse5 v_ArrVal_68))) (+ (* (select .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse2 (* (select (select (store .cse26 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse25) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse6) (not (<= v_ArrVal_68 .cse28)))) (not (<= .cse28 2147483647)) (not (<= (+ 4294967296 v_ArrVal_67) .cse9))))))) (forall ((v_ArrVal_67 Int)) (or (forall ((v_ArrVal_68 Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse8 v_ArrVal_67)))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (or (< (let ((.cse29 (store .cse31 .cse5 v_ArrVal_68))) (+ (* (select .cse29 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse2 (* (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse29) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse6) (not (<= (+ 4294967296 v_ArrVal_68) (mod (select .cse31 .cse5) 4294967296))))))) (not (<= (+ 4294967296 v_ArrVal_67) .cse9)))))) (or .cse14 (and (forall ((v_ArrVal_67 Int)) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse20 v_ArrVal_67)))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse32 (mod (select .cse35 .cse19) 4294967296))) (or (not (<= .cse32 2147483647)) (not (<= (+ 4294967296 v_ArrVal_67) .cse9)) (forall ((v_ArrVal_68 Int)) (or (< (let ((.cse33 (store .cse35 .cse19 v_ArrVal_68))) (+ .cse2 (* (select .cse33 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* (select (select (store .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse33) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse6) (not (<= v_ArrVal_68 .cse32))))))))) (forall ((v_ArrVal_67 Int)) (or (not (<= (+ 4294967296 v_ArrVal_67) .cse9)) (forall ((v_ArrVal_68 Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse20 v_ArrVal_67)))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (or (< (let ((.cse36 (store .cse38 .cse19 v_ArrVal_68))) (+ .cse2 (* (select .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* (select (select (store .cse37 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse36) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse6) (not (<= (+ 4294967296 v_ArrVal_68) (mod (select .cse38 .cse19) 4294967296))))))))))))))))) is different from true [2023-02-15 09:41:52,661 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~sum~0#1| 4)) (.cse7 (* c_~ARR_SIZE~0 c_~ARR_SIZE~0)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int)) (let ((.cse0 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) |aux_mod_ULTIMATE.start_main_~index~0#1_49|)) (.cse1 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_ULTIMATE.start_main_~index~0#1_49|) 4294967296))) (or (not (< .cse0 c_~ARR_SIZE~0)) (forall ((v_ArrVal_67 Int)) (or (not (<= (+ 4294967296 v_ArrVal_67) .cse1)) (forall ((v_ArrVal_68 Int)) (let ((.cse8 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8) v_ArrVal_67)))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8))) (or (not (<= (+ 4294967296 v_ArrVal_68) (mod (select .cse2 .cse3) 4294967296))) (< (let ((.cse4 (store .cse2 .cse3 v_ArrVal_68))) (+ (* (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse6 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse4) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse7)))))))) (not (<= 0 .cse0)) (<= .cse1 2147483647) (< 2147483647 |aux_mod_ULTIMATE.start_main_~index~0#1_49|) (> 0 |aux_mod_ULTIMATE.start_main_~index~0#1_49|)))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int)) (let ((.cse10 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) |aux_mod_ULTIMATE.start_main_~index~0#1_49|)) (.cse11 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_ULTIMATE.start_main_~index~0#1_49|) 4294967296))) (or (not (< .cse10 c_~ARR_SIZE~0)) (forall ((v_ArrVal_67 Int)) (let ((.cse17 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse17) v_ArrVal_67)))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse17))) (let ((.cse12 (mod (select .cse15 .cse16) 4294967296))) (or (not (<= (+ 4294967296 v_ArrVal_67) .cse11)) (not (<= .cse12 2147483647)) (forall ((v_ArrVal_68 Int)) (or (< (let ((.cse13 (store .cse15 .cse16 v_ArrVal_68))) (+ (* (select .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse14 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse13) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse7) (not (<= v_ArrVal_68 .cse12)))))))))) (not (<= 0 .cse10)) (<= .cse11 2147483647) (< 2147483647 |aux_mod_ULTIMATE.start_main_~index~0#1_49|) (> 0 |aux_mod_ULTIMATE.start_main_~index~0#1_49|)))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int)) (let ((.cse19 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_ULTIMATE.start_main_~index~0#1_49|) 4294967296)) (.cse18 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) |aux_mod_ULTIMATE.start_main_~index~0#1_49|))) (or (not (< .cse18 c_~ARR_SIZE~0)) (<= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 2147483647) (not (<= .cse19 2147483647)) (forall ((v_ArrVal_67 Int)) (or (not (<= v_ArrVal_67 .cse19)) (forall ((v_ArrVal_68 Int)) (let ((.cse24 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse9 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse24) v_ArrVal_67)))) (let ((.cse20 (select .cse23 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse21 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24))) (or (not (<= (+ 4294967296 v_ArrVal_68) (mod (select .cse20 .cse21) 4294967296))) (< (let ((.cse22 (store .cse20 .cse21 v_ArrVal_68))) (+ (* 4 (select .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (* (select (select (store .cse23 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse22) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5)) .cse7)))))))) (not (<= 0 .cse18)) (>= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296)))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int)) (let ((.cse30 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_ULTIMATE.start_main_~index~0#1_49|) 4294967296)) (.cse32 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) |aux_mod_ULTIMATE.start_main_~index~0#1_49|))) (or (forall ((v_ArrVal_67 Int)) (let ((.cse31 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse9 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse31) v_ArrVal_67)))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse28 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse31))) (let ((.cse29 (mod (select .cse27 .cse28) 4294967296))) (or (forall ((v_ArrVal_68 Int)) (or (< (let ((.cse25 (store .cse27 .cse28 v_ArrVal_68))) (+ (* 4 (select .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (* (select (select (store .cse26 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse25) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5)) .cse7) (not (<= v_ArrVal_68 .cse29)))) (not (<= v_ArrVal_67 .cse30)) (not (<= .cse29 2147483647)))))))) (not (< .cse32 c_~ARR_SIZE~0)) (<= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 2147483647) (not (<= .cse30 2147483647)) (not (<= 0 .cse32)) (>= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296)))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int)) (let ((.cse33 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) |aux_mod_ULTIMATE.start_main_~index~0#1_49|)) (.cse34 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_ULTIMATE.start_main_~index~0#1_49|) 4294967296))) (or (not (< .cse33 c_~ARR_SIZE~0)) (not (<= .cse34 2147483647)) (not (<= 0 .cse33)) (< 2147483647 |aux_mod_ULTIMATE.start_main_~index~0#1_49|) (> 0 |aux_mod_ULTIMATE.start_main_~index~0#1_49|) (forall ((v_ArrVal_67 Int)) (let ((.cse40 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse40) v_ArrVal_67)))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse39 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse40))) (let ((.cse35 (mod (select .cse38 .cse39) 4294967296))) (or (not (<= v_ArrVal_67 .cse34)) (not (<= .cse35 2147483647)) (forall ((v_ArrVal_68 Int)) (or (< (let ((.cse36 (store .cse38 .cse39 v_ArrVal_68))) (+ (* (select .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse37 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse36) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse7) (not (<= v_ArrVal_68 .cse35))))))))))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int)) (let ((.cse41 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) |aux_mod_ULTIMATE.start_main_~index~0#1_49|)) (.cse47 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_ULTIMATE.start_main_~index~0#1_49|) 4294967296))) (or (not (< .cse41 c_~ARR_SIZE~0)) (<= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 2147483647) (forall ((v_ArrVal_67 Int)) (let ((.cse48 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse9 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse48) v_ArrVal_67)))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse45 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse48))) (let ((.cse46 (mod (select .cse44 .cse45) 4294967296))) (or (forall ((v_ArrVal_68 Int)) (or (< (let ((.cse42 (store .cse44 .cse45 v_ArrVal_68))) (+ (* 4 (select .cse42 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (* (select (select (store .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse42) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5)) .cse7) (not (<= v_ArrVal_68 .cse46)))) (not (<= (+ 4294967296 v_ArrVal_67) .cse47)) (not (<= .cse46 2147483647)))))))) (not (<= 0 .cse41)) (<= .cse47 2147483647) (>= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296)))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int)) (let ((.cse49 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) |aux_mod_ULTIMATE.start_main_~index~0#1_49|)) (.cse50 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_ULTIMATE.start_main_~index~0#1_49|) 4294967296))) (or (not (< .cse49 c_~ARR_SIZE~0)) (not (<= .cse50 2147483647)) (not (<= 0 .cse49)) (< 2147483647 |aux_mod_ULTIMATE.start_main_~index~0#1_49|) (> 0 |aux_mod_ULTIMATE.start_main_~index~0#1_49|) (forall ((v_ArrVal_67 Int)) (or (not (<= v_ArrVal_67 .cse50)) (forall ((v_ArrVal_68 Int)) (let ((.cse55 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse55) v_ArrVal_67)))) (let ((.cse51 (select .cse54 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse52 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse55))) (or (not (<= (+ 4294967296 v_ArrVal_68) (mod (select .cse51 .cse52) 4294967296))) (< (let ((.cse53 (store .cse51 .cse52 v_ArrVal_68))) (+ (* (select .cse53 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse54 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse53) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse7))))))))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int)) (let ((.cse56 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) |aux_mod_ULTIMATE.start_main_~index~0#1_49|)) (.cse57 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_ULTIMATE.start_main_~index~0#1_49|) 4294967296))) (or (not (< .cse56 c_~ARR_SIZE~0)) (forall ((v_ArrVal_67 Int)) (or (not (<= (+ 4294967296 v_ArrVal_67) .cse57)) (forall ((v_ArrVal_68 Int)) (let ((.cse62 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse9 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse62) v_ArrVal_67)))) (let ((.cse58 (select .cse61 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse59 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse62))) (or (not (<= (+ 4294967296 v_ArrVal_68) (mod (select .cse58 .cse59) 4294967296))) (< (let ((.cse60 (store .cse58 .cse59 v_ArrVal_68))) (+ (* 4 (select .cse60 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (* (select (select (store .cse61 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse60) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5)) .cse7)))))))) (<= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 2147483647) (not (<= 0 .cse56)) (<= .cse57 2147483647) (>= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296)))))) is different from true [2023-02-15 09:41:52,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:41:52,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313249981] [2023-02-15 09:41:52,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 09:41:52,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829341624] [2023-02-15 09:41:52,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829341624] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 09:41:52,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 09:41:52,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2023-02-15 09:41:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71488819] [2023-02-15 09:41:52,672 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 09:41:52,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 09:41:52,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:41:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 09:41:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=490, Unknown=2, NotChecked=94, Total=702 [2023-02-15 09:41:52,675 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:41:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:41:53,460 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2023-02-15 09:41:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 09:41:53,460 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-02-15 09:41:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:41:53,461 INFO L225 Difference]: With dead ends: 73 [2023-02-15 09:41:53,461 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 09:41:53,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=221, Invalid=907, Unknown=2, NotChecked=130, Total=1260 [2023-02-15 09:41:53,463 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 61 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 09:41:53,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 115 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 09:41:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 09:41:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2023-02-15 09:41:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:41:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-02-15 09:41:53,471 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 28 [2023-02-15 09:41:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:41:53,471 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-02-15 09:41:53,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:41:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-02-15 09:41:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 09:41:53,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:41:53,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:41:53,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 09:41:53,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:41:53,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:41:53,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:41:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash -685364711, now seen corresponding path program 2 times [2023-02-15 09:41:53,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:41:53,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050678957] [2023-02-15 09:41:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:41:53,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:41:53,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:41:53,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887717564] [2023-02-15 09:41:53,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 09:41:53,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:41:53,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:41:53,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 09:41:53,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 09:41:53,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 09:41:53,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 09:41:53,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 09:41:53,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:41:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 09:41:53,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 09:41:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 09:41:53,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:41:53,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050678957] [2023-02-15 09:41:53,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 09:41:53,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887717564] [2023-02-15 09:41:53,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887717564] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 09:41:53,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 09:41:53,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 09:41:53,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123017837] [2023-02-15 09:41:53,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 09:41:53,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 09:41:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:41:53,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 09:41:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 09:41:53,904 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 09:41:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:41:53,998 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2023-02-15 09:41:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 09:41:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-02-15 09:41:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:41:54,001 INFO L225 Difference]: With dead ends: 59 [2023-02-15 09:41:54,001 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 09:41:54,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-15 09:41:54,003 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 59 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 09:41:54,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 89 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 09:41:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 09:41:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2023-02-15 09:41:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:41:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-02-15 09:41:54,013 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 30 [2023-02-15 09:41:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:41:54,013 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-02-15 09:41:54,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 09:41:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-02-15 09:41:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 09:41:54,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:41:54,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:41:54,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 09:41:54,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:41:54,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:41:54,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:41:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1406627783, now seen corresponding path program 3 times [2023-02-15 09:41:54,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:41:54,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715510701] [2023-02-15 09:41:54,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:41:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:41:54,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:41:54,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580819947] [2023-02-15 09:41:54,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 09:41:54,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:41:54,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:41:54,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 09:41:54,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 09:41:54,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 09:41:54,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 09:41:54,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 09:41:54,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:41:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 09:41:54,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 09:41:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 09:41:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:41:54,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715510701] [2023-02-15 09:41:54,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 09:41:54,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580819947] [2023-02-15 09:41:54,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580819947] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 09:41:54,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 09:41:54,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 09:41:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648286445] [2023-02-15 09:41:54,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 09:41:54,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 09:41:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:41:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 09:41:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 09:41:54,437 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 09:41:54,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:41:54,519 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-02-15 09:41:54,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 09:41:54,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-02-15 09:41:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:41:54,520 INFO L225 Difference]: With dead ends: 38 [2023-02-15 09:41:54,520 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 09:41:54,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-15 09:41:54,521 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 09:41:54,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 54 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 09:41:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 09:41:54,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-02-15 09:41:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:41:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-02-15 09:41:54,525 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2023-02-15 09:41:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:41:54,525 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-02-15 09:41:54,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 09:41:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-02-15 09:41:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 09:41:54,526 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:41:54,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:41:54,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 09:41:54,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:41:54,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:41:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:41:54,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1198632411, now seen corresponding path program 4 times [2023-02-15 09:41:54,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:41:54,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409173257] [2023-02-15 09:41:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:41:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:41:54,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:41:54,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [169475752] [2023-02-15 09:41:54,749 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 09:41:54,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:41:54,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:41:54,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 09:41:54,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 09:41:54,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 09:41:54,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 09:41:54,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 71 conjunts are in the unsatisfiable core [2023-02-15 09:41:54,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:41:54,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 09:41:54,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:54,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2023-02-15 09:41:54,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-02-15 09:41:54,946 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2023-02-15 09:41:54,952 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2023-02-15 09:41:55,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2023-02-15 09:41:55,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2023-02-15 09:41:55,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:55,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:55,433 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2023-02-15 09:41:55,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 105 [2023-02-15 09:41:55,450 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 09:41:55,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 195 [2023-02-15 09:41:55,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:41:55,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:55,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:55,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 144 [2023-02-15 09:41:55,741 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 09:41:56,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 107 [2023-02-15 09:41:56,430 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:41:56,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:56,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:56,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-15 09:41:56,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:56,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:41:56,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-02-15 09:41:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 09:41:56,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 09:44:13,492 WARN L233 SmtUtils]: Spent 1.45m on a formula simplification. DAG size of input: 195 DAG size of output: 178 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 09:44:31,620 WARN L859 $PredicateComparison]: unable to prove that (or (not (< 1 c_~ARR_SIZE~0)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~sum~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse9 (* c_~ARR_SIZE~0 c_~ARR_SIZE~0))) (and (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse12 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296) 4))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse12) (+ (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) 4294967296) (- 4294967296)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (+ .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse8 (mod (select .cse6 .cse7) 4294967296)) (.cse11 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (.cse10 (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))) (or (< (let ((.cse3 (store .cse6 .cse7 .cse8))) (let ((.cse0 (select (store .cse5 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse3) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (* (select .cse0 .cse1) 4) (* (select .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* (select .cse3 .cse4) 4)))) .cse9) (not (<= .cse8 2147483647)) (not (< .cse10 c_~ARR_SIZE~0)) (< .cse11 .cse10) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) (< .cse10 .cse11) (not (<= 0 .cse10)) (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse23 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296) 4)) (.cse22 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) 4294967296))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23) .cse22)))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse18 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse19 (mod (select .cse17 .cse18) 4294967296)) (.cse21 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (.cse20 (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))) (or (< (let ((.cse15 (store .cse17 .cse18 .cse19))) (let ((.cse14 (select (store .cse16 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse15) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (* 4 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (* (select .cse15 .cse4) 4) (* (select .cse14 .cse1) 4) .cse2 (* (select .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4)))) .cse9) (not (< .cse20 c_~ARR_SIZE~0)) (< .cse21 .cse20) (not (<= .cse19 2147483647)) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) (< .cse20 .cse21) (not (<= .cse22 2147483647)) (not (<= 0 .cse20)) (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse25 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (.cse24 (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))) (or (not (< .cse24 c_~ARR_SIZE~0)) (< .cse25 .cse24) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) (< (let ((.cse31 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296) 4))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse31) (+ (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) 4294967296) (- 4294967296)))))) (let ((.cse27 (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse30 (+ .cse31 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store .cse29 .cse30 (+ (mod (select .cse29 .cse30) 4294967296) (- 4294967296)))))) (let ((.cse26 (select (store .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse27) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (* (select .cse26 .cse1) 4) (* (select .cse27 .cse4) 4) (* (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) (* (select .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse2))))) .cse9) (< .cse24 .cse25) (not (<= 0 .cse24)) (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|)))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse33 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (.cse32 (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 2147483647) (not (< .cse32 c_~ARR_SIZE~0)) (< .cse33 .cse32) (< (let ((.cse39 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296) 4))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse39) (+ (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) 4294967296) (- 4294967296)))))) (let ((.cse35 (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse38 (+ (- 17179869184) .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store .cse37 .cse38 (+ (mod (select .cse37 .cse38) 4294967296) (- 4294967296)))))) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse35) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (* (select .cse34 .cse1) 4) (* (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse2 (* (select .cse34 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) (* (select .cse35 .cse4) 4)))))) .cse9) (< .cse32 .cse33) (not (<= 0 .cse32)) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296)))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse48 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296) 4))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse48) (+ (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) 4294967296) (- 4294967296)))))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse44 (+ (- 17179869184) .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse47 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (.cse45 (mod (select .cse43 .cse44) 4294967296)) (.cse46 (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))) (or (< (let ((.cse40 (store .cse43 .cse44 .cse45))) (let ((.cse41 (select (store .cse42 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse40) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (* (select .cse40 .cse4) 4) (* 4 (select .cse40 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (* (select .cse41 .cse1) 4) (* (select .cse41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2))) .cse9) (<= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 2147483647) (not (< .cse46 c_~ARR_SIZE~0)) (< .cse47 .cse46) (< .cse46 .cse47) (not (<= .cse45 2147483647)) (not (<= 0 .cse46)) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296))))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse57 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (.cse55 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) 4294967296)) (.cse56 (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 2147483647) (< (let ((.cse54 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296) 4))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse54) .cse55)))) (let ((.cse49 (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse53 (+ (- 17179869184) .cse54 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store .cse52 .cse53 (+ (- 4294967296) (mod (select .cse52 .cse53) 4294967296)))))) (let ((.cse50 (select (store .cse51 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse49) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (* (select .cse49 .cse4) 4) (* (select .cse50 .cse1) 4) .cse2 (* (select .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select .cse50 |c_ULTIMATE.start_main_~#array1~0#1.offset|))))))) .cse9) (not (< .cse56 c_~ARR_SIZE~0)) (< .cse57 .cse56) (< .cse56 .cse57) (not (<= .cse55 2147483647)) (not (<= 0 .cse56)) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296)))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (let ((.cse59 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (.cse66 (mod (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) 4294967296)) (.cse58 (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))) (or (not (< .cse58 c_~ARR_SIZE~0)) (< .cse59 .cse58) (< (let ((.cse65 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114| 4294967296) 4))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse65) .cse66)))) (let ((.cse61 (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse64 (+ .cse65 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store .cse63 .cse64 (+ (mod (select .cse63 .cse64) 4294967296) (- 4294967296)))))) (let ((.cse60 (select (store .cse62 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse61) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (* (select .cse60 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) (* (select .cse61 .cse4) 4) (* 4 (select .cse61 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) .cse2 (* 4 (select .cse60 .cse1))))))) .cse9) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|) (< .cse58 .cse59) (not (<= .cse66 2147483647)) (not (<= 0 .cse58)) (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_40_114|))))))) is different from true [2023-02-15 09:44:31,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:44:31,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409173257] [2023-02-15 09:44:31,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 09:44:31,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169475752] [2023-02-15 09:44:31,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169475752] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 09:44:31,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 09:44:31,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2023-02-15 09:44:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584240239] [2023-02-15 09:44:31,627 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 09:44:31,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 09:44:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:44:31,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 09:44:31,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=790, Unknown=10, NotChecked=58, Total=992 [2023-02-15 09:44:31,629 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:44:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:44:34,587 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-02-15 09:44:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 09:44:34,588 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2023-02-15 09:44:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:44:34,588 INFO L225 Difference]: With dead ends: 74 [2023-02-15 09:44:34,588 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 09:44:34,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 115.9s TimeCoverageRelationStatistics Valid=280, Invalid=1606, Unknown=10, NotChecked=84, Total=1980 [2023-02-15 09:44:34,590 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 66 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 09:44:34,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 09:44:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 09:44:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2023-02-15 09:44:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 43 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 09:44:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-02-15 09:44:34,600 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 32 [2023-02-15 09:44:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:44:34,600 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-02-15 09:44:34,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 09:44:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-02-15 09:44:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 09:44:34,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:44:34,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:44:34,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 09:44:34,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:44:34,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:44:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:44:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash 940466973, now seen corresponding path program 1 times [2023-02-15 09:44:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:44:34,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115971089] [2023-02-15 09:44:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:44:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:44:34,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:44:34,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887750195] [2023-02-15 09:44:34,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:44:34,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:44:34,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:44:34,840 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 09:44:34,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 09:44:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:44:34,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 65 conjunts are in the unsatisfiable core [2023-02-15 09:44:34,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:44:35,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 09:44:35,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:35,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2023-02-15 09:44:35,042 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2023-02-15 09:44:35,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-15 09:44:35,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2023-02-15 09:44:35,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2023-02-15 09:44:35,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:35,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:35,558 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2023-02-15 09:44:35,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 105 [2023-02-15 09:44:35,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:35,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:35,610 INFO L321 Elim1Store]: treesize reduction 46, result has 38.7 percent of original size [2023-02-15 09:44:35,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 46 [2023-02-15 09:44:35,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 99 [2023-02-15 09:44:35,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:35,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:35,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:35,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:44:35,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 150 [2023-02-15 09:44:35,924 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 183 treesize of output 71 [2023-02-15 09:44:36,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:36,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:44:36,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:44:36,663 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:44:36,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2023-02-15 09:44:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 09:44:36,889 INFO L328 TraceCheckSpWp]: Computing backward predicates...