./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array11_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array11_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 c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:07:02,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:07:02,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:07:02,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:07:02,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:07:02,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:07:02,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:07:02,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:07:02,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:07:02,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:07:02,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:07:02,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:07:02,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:07:02,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:07:02,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:07:02,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:07:02,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:07:02,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:07:02,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:07:02,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:07:02,391 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:07:02,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:07:02,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:07:02,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:07:02,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:07:02,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:07:02,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:07:02,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:07:02,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:07:02,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:07:02,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:07:02,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:07:02,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:07:02,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:07:02,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:07:02,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:07:02,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:07:02,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:07:02,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:07:02,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:07:02,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:07:02,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:07:02,402 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:07:02,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:07:02,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:07:02,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:07:02,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:07:02,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:07:02,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:07:02,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:07:02,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:07:02,416 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:07:02,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:07:02,417 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:07:02,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:07:02,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:07:02,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:07:02,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:07:02,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:07:02,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:07:02,418 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:07:02,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:07:02,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:07:02,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:07:02,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:07:02,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:07:02,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:07:02,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:07:02,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:07:02,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:07:02,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:07:02,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:07:02,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:07:02,420 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:07:02,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:07:02,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:07:02,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb [2022-07-19 10:07:02,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:07:02,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:07:02,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:07:02,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:07:02,602 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:07:02,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array11_pattern.c [2022-07-19 10:07:02,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5407feef/c4c3b17052c84b2c9dff8fe5b41fb0a0/FLAG86d22c4a1 [2022-07-19 10:07:02,992 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:07:02,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array11_pattern.c [2022-07-19 10:07:02,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5407feef/c4c3b17052c84b2c9dff8fe5b41fb0a0/FLAG86d22c4a1 [2022-07-19 10:07:03,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5407feef/c4c3b17052c84b2c9dff8fe5b41fb0a0 [2022-07-19 10:07:03,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:07:03,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:07:03,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:07:03,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:07:03,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:07:03,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256816b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03, skipping insertion in model container [2022-07-19 10:07:03,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:07:03,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:07:03,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array11_pattern.c[1357,1370] [2022-07-19 10:07:03,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:07:03,182 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:07:03,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array11_pattern.c[1357,1370] [2022-07-19 10:07:03,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:07:03,220 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:07:03,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03 WrapperNode [2022-07-19 10:07:03,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:07:03,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:07:03,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:07:03,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:07:03,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,242 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2022-07-19 10:07:03,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:07:03,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:07:03,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:07:03,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:07:03,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:07:03,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:07:03,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:07:03,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:07:03,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (1/1) ... [2022-07-19 10:07:03,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:07:03,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:07:03,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:07:03,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:07:03,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:07:03,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 10:07:03,326 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 10:07:03,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:07:03,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:07:03,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:07:03,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:07:03,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:07:03,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:07:03,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:07:03,386 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:07:03,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:07:03,481 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:07:03,485 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:07:03,486 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 10:07:03,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:07:03 BoogieIcfgContainer [2022-07-19 10:07:03,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:07:03,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:07:03,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:07:03,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:07:03,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:07:03" (1/3) ... [2022-07-19 10:07:03,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25542b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:07:03, skipping insertion in model container [2022-07-19 10:07:03,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:03" (2/3) ... [2022-07-19 10:07:03,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25542b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:07:03, skipping insertion in model container [2022-07-19 10:07:03,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:07:03" (3/3) ... [2022-07-19 10:07:03,502 INFO L111 eAbstractionObserver]: Analyzing ICFG array11_pattern.c [2022-07-19 10:07:03,522 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:07:03,523 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:07:03,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:07:03,571 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5cd05dab, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a278cfa [2022-07-19 10:07:03,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:07:03,576 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) [2022-07-19 10:07:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 10:07:03,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:07:03,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:07:03,584 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:07:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:07:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1199380475, now seen corresponding path program 1 times [2022-07-19 10:07:03,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:07:03,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619387713] [2022-07-19 10:07:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:03,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:07:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:07:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:07:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:07:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:07:03,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:07:03,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619387713] [2022-07-19 10:07:03,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619387713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:07:03,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:07:03,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:07:03,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475560338] [2022-07-19 10:07:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:07:03,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:07:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:07:03,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:07:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:07:03,752 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) [2022-07-19 10:07:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:07:03,764 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-07-19 10:07:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:07:03,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-19 10:07:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:07:03,770 INFO L225 Difference]: With dead ends: 51 [2022-07-19 10:07:03,770 INFO L226 Difference]: Without dead ends: 23 [2022-07-19 10:07:03,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:07:03,774 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 [2022-07-19 10:07:03,775 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] [2022-07-19 10:07:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-19 10:07:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-19 10:07:03,796 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) [2022-07-19 10:07:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-19 10:07:03,798 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-07-19 10:07:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:07:03,798 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-19 10:07:03,798 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) [2022-07-19 10:07:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-19 10:07:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:07:03,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:07:03,800 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] [2022-07-19 10:07:03,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:07:03,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:07:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:07:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash 966180883, now seen corresponding path program 1 times [2022-07-19 10:07:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:07:03,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782574923] [2022-07-19 10:07:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:07:03,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:07:03,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806304571] [2022-07-19 10:07:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:03,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:03,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:07:03,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:07:03,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:07:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:07:03,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:07:03,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:07:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:07:03,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:07:03,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:07:03,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782574923] [2022-07-19 10:07:03,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:07:03,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806304571] [2022-07-19 10:07:03,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806304571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:07:03,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:07:03,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:07:03,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160835542] [2022-07-19 10:07:03,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:07:03,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:07:03,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:07:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:07:03,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:07:03,961 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-07-19 10:07:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:07:03,977 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-07-19 10:07:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:07:03,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 24 [2022-07-19 10:07:03,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:07:03,978 INFO L225 Difference]: With dead ends: 28 [2022-07-19 10:07:03,978 INFO L226 Difference]: Without dead ends: 24 [2022-07-19 10:07:03,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:07:03,979 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:07:03,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:07:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-19 10:07:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-19 10:07:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2022-07-19 10:07:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-19 10:07:03,984 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 24 [2022-07-19 10:07:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:07:03,985 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-19 10:07:03,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-07-19 10:07:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-19 10:07:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:07:03,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:07:03,986 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] [2022-07-19 10:07:04,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:07:04,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:04,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:07:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:07:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash 840126261, now seen corresponding path program 1 times [2022-07-19 10:07:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:07:04,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912377917] [2022-07-19 10:07:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:04,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:07:04,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:07:04,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239784649] [2022-07-19 10:07:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:04,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:07:04,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:07:04,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:07:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:07:04,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 10:07:04,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:07:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:07:04,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:07:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:07:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912377917] [2022-07-19 10:07:04,326 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:07:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239784649] [2022-07-19 10:07:04,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239784649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:07:04,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:07:04,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:07:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252289203] [2022-07-19 10:07:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:07:04,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:07:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:07:04,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:07:04,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:07:04,328 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-07-19 10:07:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:07:04,370 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-07-19 10:07:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:07:04,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2022-07-19 10:07:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:07:04,371 INFO L225 Difference]: With dead ends: 45 [2022-07-19 10:07:04,371 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 10:07:04,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:07:04,372 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:07:04,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 75 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:07:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 10:07:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-07-19 10:07:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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) [2022-07-19 10:07:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-19 10:07:04,376 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 26 [2022-07-19 10:07:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:07:04,376 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-19 10:07:04,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-07-19 10:07:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-19 10:07:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:07:04,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:07:04,377 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] [2022-07-19 10:07:04,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:07:04,579 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,SelfDestructingSolverStorable2 [2022-07-19 10:07:04,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:07:04,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:07:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash -760544265, now seen corresponding path program 1 times [2022-07-19 10:07:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:07:04,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123404452] [2022-07-19 10:07:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:07:04,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:07:04,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481210173] [2022-07-19 10:07:04,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:04,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:04,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:07:04,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:07:04,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:07:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:07:04,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:07:04,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:07:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:07:04,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:07:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:07:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:07:04,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123404452] [2022-07-19 10:07:04,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:07:04,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481210173] [2022-07-19 10:07:04,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481210173] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:07:04,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:07:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-07-19 10:07:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323624545] [2022-07-19 10:07:04,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:07:04,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:07:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:07:04,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:07:04,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:07:04,865 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:07:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:07:05,029 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-07-19 10:07:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:07:05,030 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-19 10:07:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:07:05,030 INFO L225 Difference]: With dead ends: 90 [2022-07-19 10:07:05,031 INFO L226 Difference]: Without dead ends: 72 [2022-07-19 10:07:05,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:07:05,032 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 80 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:07:05,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 97 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:07:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-19 10:07:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 37. [2022-07-19 10:07:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:07:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-07-19 10:07:05,041 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 28 [2022-07-19 10:07:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:07:05,044 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-07-19 10:07:05,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:07:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-07-19 10:07:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:07:05,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:07:05,045 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] [2022-07-19 10:07:05,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:07:05,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:05,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:07:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:07:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash -367517255, now seen corresponding path program 1 times [2022-07-19 10:07:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:07:05,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856122651] [2022-07-19 10:07:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:07:05,278 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:07:05,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1523567932] [2022-07-19 10:07:05,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:05,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:05,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:07:05,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:07:05,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:07:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:07:05,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 10:07:05,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:07:05,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:07:05,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:05,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-19 10:07:05,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-19 10:07:05,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 10:07:05,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 10:07:07,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-07-19 10:07:07,906 INFO L356 Elim1Store]: treesize reduction 60, result has 7.7 percent of original size [2022-07-19 10:07:07,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 95 [2022-07-19 10:07:10,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:10,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 73 [2022-07-19 10:07:15,543 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|) |c_ULTIMATE.start_main_~#array2~0#1.offset|) 0) (let ((.cse0 (<= (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296) 2147483647))) (or (and (not .cse0) (or (exists ((|ULTIMATE.start_main_~num~0#1| Int)) (let ((.cse1 (mod (* (* |ULTIMATE.start_main_~num~0#1| (* (* |c_ULTIMATE.start_main_~index~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|)) |ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (not (<= .cse1 2147483647)) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296) 4))) 4294967296) .cse1)))) (exists ((v_prenex_4 Int)) (let ((.cse2 (mod (* (* (* (* |c_ULTIMATE.start_main_~index~0#1| v_prenex_4) v_prenex_4) v_prenex_4) v_prenex_4) 4294967296))) (and (<= .cse2 2147483647) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296) 4))) .cse2))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (exists ((v_DerPreprocessor_1 Int)) (= 0 (select (let ((.cse5 (* (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296) 4))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5))) (store (store .cse3 .cse4 v_DerPreprocessor_1) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5) (select .cse3 .cse4)))) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (exists ((|ULTIMATE.start_main_~num~0#1| Int)) (let ((.cse6 (mod (* (* |ULTIMATE.start_main_~num~0#1| (* (* |c_ULTIMATE.start_main_~index~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|)) |ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (= (+ .cse6 (- 4294967296)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) (not (<= .cse6 2147483647))))) (exists ((|ULTIMATE.start_main_~num~0#1| Int)) (let ((.cse7 (mod (* (* |ULTIMATE.start_main_~num~0#1| (* (* |c_ULTIMATE.start_main_~index~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|)) |ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (<= .cse7 2147483647) (= .cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296) 4)))))))) .cse0))) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= |c_ULTIMATE.start_main_~sum~0#1| 0) (<= c_~ARR_SIZE~0 1)) is different from true [2022-07-19 10:07:15,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2022-07-19 10:07:15,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:15,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:07:15,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 119 [2022-07-19 10:07:15,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:15,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 53 [2022-07-19 10:07:15,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-19 10:07:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:07:15,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:07:32,789 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296) 2147483647))) (and (or .cse0 (and (forall ((|ULTIMATE.start_main_~num~0#1| Int)) (let ((.cse7 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse6 (* .cse7 4)) (.cse3 (mod (* (* (* (* (+ (- 1) c_~ARR_SIZE~0) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse6) (+ .cse3 (- 4294967296)))))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse6) (+ .cse7 (- 4294967296))))) (let ((.cse1 (select (select (store .cse5 |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|)) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| .cse2) 0) (<= .cse3 2147483647) (= (* c_~ARR_SIZE~0 2) (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse2))))))))) (forall ((|ULTIMATE.start_main_~num~0#1| Int)) (let ((.cse14 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse13 (* .cse14 4)) (.cse10 (mod (* (* (* (* (+ (- 1) c_~ARR_SIZE~0) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse13) .cse10)))) (let ((.cse11 (store (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse13) (+ .cse14 (- 4294967296))))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse11) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse8 .cse9) 0) (not (<= .cse10 2147483647)) (= (* c_~ARR_SIZE~0 2) (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse8 .cse9))))))))))) (or (not .cse0) (and (forall ((|ULTIMATE.start_main_~num~0#1| Int)) (let ((.cse21 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse20 (* .cse21 4)) (.cse17 (mod (* (* (* (* (+ (- 1) c_~ARR_SIZE~0) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse20) .cse17)))) (let ((.cse18 (store (select .cse19 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse20) .cse21))) (let ((.cse15 (select (select (store .cse19 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse18) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= (* c_~ARR_SIZE~0 2) (+ .cse15 .cse16 |c_ULTIMATE.start_main_~sum~0#1| 2)) (not (<= .cse17 2147483647)) (= (+ .cse15 .cse16 |c_ULTIMATE.start_main_~sum~0#1|) 0)))))))) (forall ((|ULTIMATE.start_main_~num~0#1| Int)) (let ((.cse28 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse27 (* .cse28 4)) (.cse22 (mod (* (* (* (* (+ (- 1) c_~ARR_SIZE~0) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse27) (+ .cse22 (- 4294967296)))))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse27) .cse28))) (let ((.cse23 (select .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse26) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (<= .cse22 2147483647) (= (+ .cse23 |c_ULTIMATE.start_main_~sum~0#1| .cse24) 0) (= (* c_~ARR_SIZE~0 2) (+ .cse23 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse24))))))))))))) is different from true [2022-07-19 10:07:34,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:07:34,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856122651] [2022-07-19 10:07:34,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:07:34,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523567932] [2022-07-19 10:07:34,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523567932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:07:34,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:07:34,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-07-19 10:07:34,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818323180] [2022-07-19 10:07:34,345 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 10:07:34,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 10:07:34,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:07:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 10:07:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=180, Unknown=2, NotChecked=58, Total=306 [2022-07-19 10:07:34,346 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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) [2022-07-19 10:07:36,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:07:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:07:36,428 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-19 10:07:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:07:36,428 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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 [2022-07-19 10:07:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:07:36,430 INFO L225 Difference]: With dead ends: 48 [2022-07-19 10:07:36,430 INFO L226 Difference]: Without dead ends: 44 [2022-07-19 10:07:36,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=87, Invalid=225, Unknown=2, NotChecked=66, Total=380 [2022-07-19 10:07:36,431 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:07:36,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 122 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 59 Unchecked, 2.0s Time] [2022-07-19 10:07:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-19 10:07:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-07-19 10:07:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:07:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-07-19 10:07:36,442 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 28 [2022-07-19 10:07:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:07:36,443 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-07-19 10:07:36,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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) [2022-07-19 10:07:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-07-19 10:07:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:07:36,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:07:36,444 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] [2022-07-19 10:07:36,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:07:36,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:36,663 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:07:36,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:07:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash -943530149, now seen corresponding path program 2 times [2022-07-19 10:07:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:07:36,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575033452] [2022-07-19 10:07:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:07:36,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:07:36,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32853819] [2022-07-19 10:07:36,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:07:36,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:36,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:07:36,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:07:36,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:07:36,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:07:36,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:07:36,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:07:36,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:07:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:07:36,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:07:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:07:36,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:07:36,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575033452] [2022-07-19 10:07:36,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:07:36,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32853819] [2022-07-19 10:07:36,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32853819] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:07:36,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:07:36,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-19 10:07:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118521800] [2022-07-19 10:07:36,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:07:36,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:07:36,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:07:36,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:07:36,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:07:36,815 INFO L87 Difference]: Start difference. First operand 40 states and 46 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) [2022-07-19 10:07:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:07:36,883 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-07-19 10:07:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:07:36,884 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 [2022-07-19 10:07:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:07:36,886 INFO L225 Difference]: With dead ends: 55 [2022-07-19 10:07:36,886 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 10:07:36,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:07:36,888 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:07:36,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 99 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:07:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 10:07:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-07-19 10:07:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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) [2022-07-19 10:07:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-19 10:07:36,896 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 30 [2022-07-19 10:07:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:07:36,898 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-19 10:07:36,899 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) [2022-07-19 10:07:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-19 10:07:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:07:36,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:07:36,899 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] [2022-07-19 10:07:36,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:07:37,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:37,116 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:07:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:07:37,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1406627783, now seen corresponding path program 2 times [2022-07-19 10:07:37,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:07:37,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492093537] [2022-07-19 10:07:37,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:37,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:07:37,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:07:37,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081694084] [2022-07-19 10:07:37,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:07:37,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:37,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:07:37,133 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:07:37,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 10:07:37,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:07:37,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:07:37,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:07:37,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:07:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:07:37,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:07:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:07:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:07:37,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492093537] [2022-07-19 10:07:37,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:07:37,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081694084] [2022-07-19 10:07:37,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081694084] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:07:37,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:07:37,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-19 10:07:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154648074] [2022-07-19 10:07:37,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:07:37,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:07:37,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:07:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:07:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:07:37,662 INFO L87 Difference]: Start difference. First operand 27 states and 31 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) [2022-07-19 10:07:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:07:37,738 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-07-19 10:07:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:07:37,738 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 [2022-07-19 10:07:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:07:37,739 INFO L225 Difference]: With dead ends: 38 [2022-07-19 10:07:37,739 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 10:07:37,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:07:37,739 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:07:37,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 75 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:07:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 10:07:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-19 10:07:37,744 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) [2022-07-19 10:07:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-19 10:07:37,744 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2022-07-19 10:07:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:07:37,744 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-19 10:07:37,745 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) [2022-07-19 10:07:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-19 10:07:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:07:37,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:07:37,745 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] [2022-07-19 10:07:37,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 10:07:37,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:37,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:07:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:07:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1198632411, now seen corresponding path program 3 times [2022-07-19 10:07:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:07:37,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431409497] [2022-07-19 10:07:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:07:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:07:37,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:07:37,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400730048] [2022-07-19 10:07:37,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:07:37,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:07:37,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:07:37,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:07:37,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 10:07:38,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 10:07:38,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:07:38,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-19 10:07:38,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:07:38,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:07:38,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:38,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-19 10:07:38,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-19 10:07:38,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 10:07:38,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 10:07:38,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:38,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2022-07-19 10:07:38,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:38,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 10:07:38,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:38,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:38,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-07-19 10:07:38,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-07-19 10:07:38,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:38,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:38,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:38,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:38,478 INFO L356 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2022-07-19 10:07:38,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:07:39,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 137 [2022-07-19 10:07:39,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:39,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:07:39,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:39,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:39,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 118 [2022-07-19 10:07:40,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 93 [2022-07-19 10:07:40,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:40,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:40,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:07:40,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:40,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:40,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:40,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:07:40,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-07-19 10:07:40,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:40,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:07:40,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:07:40,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-19 10:07:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:07:40,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:07:54,564 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:08:48,666 WARN L855 $PredicateComparison]: unable to prove that (or (< 2 c_~ARR_SIZE~0) (let ((.cse74 (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (let ((.cse75 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296)) (.cse22 (mod .cse74 4294967296))) (let ((.cse6 (<= .cse22 2147483647)) (.cse73 (* .cse75 4)) (.cse26 (<= .cse75 2147483647)) (.cse43 (mod (* (* (* .cse74 |c_ULTIMATE.start_main_~num~0#1|) |c_ULTIMATE.start_main_~num~0#1|) |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse44 (<= .cse43 2147483647)) (.cse0 (not .cse26)) (.cse13 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse73)) (.cse24 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse73)) (.cse14 (+ .cse22 (- 4294967296))) (.cse19 (not .cse6)) (.cse1 (* c_~ARR_SIZE~0 2)) (.cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (.cse10 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)) (.cse35 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse73)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse42 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse73))) (and (or (let ((.cse25 (+ .cse43 (- 4294967296)))) (and (or .cse0 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse23 .cse24 .cse25)))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (let ((.cse9 (store .cse12 .cse13 .cse14))) (let ((.cse7 (select (store .cse11 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse9) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse3 (select .cse9 .cse10)) (.cse4 (select .cse7 .cse8)) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse1 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse2 .cse3 .cse4 .cse5)) .cse6 (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse2 .cse3 .cse4 .cse5) 0))))) (let ((.cse21 (store .cse12 .cse13 .cse22))) (let ((.cse20 (select (store .cse11 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse21) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse15 (select .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse16 (select .cse21 .cse10)) (.cse17 (select .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse18 (select .cse20 .cse8))) (or (= (+ .cse15 .cse16 |c_ULTIMATE.start_main_~sum~0#1| .cse17 .cse18) 0) .cse19 (= .cse1 (+ .cse15 .cse16 |c_ULTIMATE.start_main_~sum~0#1| .cse17 2 .cse18)))))))))) (or .cse26 (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse23 .cse42 .cse25)))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (let ((.cse31 (store .cse34 .cse35 .cse22))) (let ((.cse32 (select (store .cse33 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse31) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse27 (select .cse31 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse28 (select .cse32 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse29 (select .cse32 .cse8)) (.cse30 (select .cse31 .cse10))) (or .cse19 (= (+ .cse27 .cse28 .cse29 |c_ULTIMATE.start_main_~sum~0#1| .cse30) 0) (= .cse1 (+ .cse27 .cse28 .cse29 |c_ULTIMATE.start_main_~sum~0#1| .cse30 2)))))) (let ((.cse40 (store .cse34 .cse35 .cse14))) (let ((.cse41 (select (store .cse33 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse40) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse36 (select .cse41 .cse8)) (.cse37 (select .cse41 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse38 (select .cse40 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse39 (select .cse40 .cse10))) (or .cse6 (= (+ .cse36 |c_ULTIMATE.start_main_~sum~0#1| .cse37 .cse38 .cse39) 0) (= (+ .cse36 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse37 .cse38 .cse39) .cse1))))))))))) .cse44) (or (not .cse44) (and (or .cse0 (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse23 .cse24 .cse43)))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (let ((.cse50 (store .cse52 .cse13 .cse14))) (let ((.cse49 (select (store .cse51 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse50) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse45 (select .cse49 .cse8)) (.cse46 (select .cse50 .cse10)) (.cse47 (select .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse48 (select .cse49 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= (+ .cse45 .cse46 |c_ULTIMATE.start_main_~sum~0#1| .cse47 .cse48) 0) .cse6 (= (+ .cse45 .cse46 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse47 .cse48) .cse1))))) (let ((.cse58 (store .cse52 .cse13 .cse22))) (let ((.cse57 (select (store .cse51 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse58) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse53 (select .cse57 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse54 (select .cse58 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse55 (select .cse58 .cse10)) (.cse56 (select .cse57 .cse8))) (or (= (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse53 .cse54 .cse55 .cse56) .cse1) .cse19 (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse53 .cse54 .cse55 .cse56) 0))))))))) (or .cse26 (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse23 .cse42 .cse43)))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (let ((.cse63 (store .cse66 .cse35 .cse14))) (let ((.cse64 (select (store .cse65 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse63) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse59 (select .cse64 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse60 (select .cse63 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse61 (select .cse64 .cse8)) (.cse62 (select .cse63 .cse10))) (or .cse6 (= (+ .cse59 .cse60 |c_ULTIMATE.start_main_~sum~0#1| .cse61 .cse62) 0) (= .cse1 (+ .cse59 .cse60 |c_ULTIMATE.start_main_~sum~0#1| .cse61 2 .cse62)))))) (let ((.cse72 (store .cse66 .cse35 .cse22))) (let ((.cse71 (select (store .cse65 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse72) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse67 (select .cse72 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse68 (select .cse72 .cse10)) (.cse69 (select .cse71 .cse8)) (.cse70 (select .cse71 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= (+ .cse67 |c_ULTIMATE.start_main_~sum~0#1| .cse68 .cse69 .cse70) 0) .cse19 (= .cse1 (+ .cse67 |c_ULTIMATE.start_main_~sum~0#1| .cse68 2 .cse69 .cse70))))))))))))))))) (= |c_ULTIMATE.start_main_~index~0#1| (+ (- 1) c_~ARR_SIZE~0))) is different from true [2022-07-19 10:08:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:08:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431409497] [2022-07-19 10:08:52,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:08:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400730048] [2022-07-19 10:08:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400730048] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:08:52,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:08:52,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-07-19 10:08:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693778317] [2022-07-19 10:08:52,261 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 10:08:52,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 10:08:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:08:52,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 10:08:52,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=4, NotChecked=58, Total=992 [2022-07-19 10:08:52,262 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) 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) [2022-07-19 10:08:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:08:53,712 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-07-19 10:08:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:08:53,713 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) 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 [2022-07-19 10:08:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:08:53,713 INFO L225 Difference]: With dead ends: 58 [2022-07-19 10:08:53,713 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 10:08:53,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=4, NotChecked=66, Total=1260 [2022-07-19 10:08:53,714 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:08:53,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 214 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 107 Unchecked, 0.1s Time] [2022-07-19 10:08:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 10:08:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-07-19 10:08:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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) [2022-07-19 10:08:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-07-19 10:08:53,721 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 32 [2022-07-19 10:08:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:08:53,721 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-07-19 10:08:53,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) 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) [2022-07-19 10:08:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-07-19 10:08:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:08:53,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:08:53,724 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] [2022-07-19 10:08:53,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:08:53,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:08:53,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:08:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:08:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 940466973, now seen corresponding path program 3 times [2022-07-19 10:08:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:08:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636658274] [2022-07-19 10:08:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:08:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:08:53,945 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:08:53,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061893685] [2022-07-19 10:08:53,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:08:53,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:08:53,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:08:53,949 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:08:53,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 10:08:54,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 10:08:54,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:08:54,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-19 10:08:54,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:08:54,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:08:54,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:54,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-19 10:08:54,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 10:08:54,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-19 10:08:54,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:54,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:54,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:08:54,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-07-19 10:08:54,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:54,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:54,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:54,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:54,428 INFO L356 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2022-07-19 10:08:54,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:08:54,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:54,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 41 [2022-07-19 10:08:56,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 215 [2022-07-19 10:08:56,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:56,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:56,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:56,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:56,803 INFO L356 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2022-07-19 10:08:56,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 121 [2022-07-19 10:08:56,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:56,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:56,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:56,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:56,865 INFO L356 Elim1Store]: treesize reduction 84, result has 24.3 percent of original size [2022-07-19 10:08:56,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 148 treesize of output 82 [2022-07-19 10:08:57,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 141 [2022-07-19 10:08:57,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:08:57,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:57,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:57,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:57,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:08:57,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:57,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2022-07-19 10:08:57,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:08:57,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:08:57,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:08:57,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 56 treesize of output 38 [2022-07-19 10:08:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:08:57,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:09:14,342 WARN L855 $PredicateComparison]: unable to prove that (or (< 2 c_~ARR_SIZE~0) (let ((.cse12 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse23 (* .cse12 4)) (.cse15 (mod (* (* (* (* (+ (- 1) c_~ARR_SIZE~0) |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 ((.cse5 (<= .cse15 2147483647)) (.cse0 (* c_~ARR_SIZE~0 2)) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23))) (and (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 .cse14 (+ .cse15 (- 4294967296)))))) (let ((.cse6 (store (select .cse10 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 .cse12))) (let ((.cse7 (select (store .cse10 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse6) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse1 (select .cse7 .cse9)) (.cse2 (select .cse6 .cse8)) (.cse3 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse1 2 .cse2 .cse3 .cse4)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse1 .cse2 .cse3 .cse4) 0) .cse5))))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 .cse14 .cse15)))) (let ((.cse20 (store (select .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 .cse12))) (let ((.cse21 (select (store .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse20) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse16 (select .cse21 .cse9)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse18 (select .cse21 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse19 (select .cse20 .cse8))) (or (not .cse5) (= .cse0 (+ .cse16 .cse17 |c_ULTIMATE.start_main_~sum~0#1| .cse18 2 .cse19)) (= (+ .cse16 .cse17 |c_ULTIMATE.start_main_~sum~0#1| .cse18 .cse19) 0)))))))))) (<= c_~ARR_SIZE~0 1)) is different from true [2022-07-19 10:10:05,233 WARN L855 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main_~count~0#1| c_~ARR_SIZE~0) (< 2 c_~ARR_SIZE~0) (let ((.cse12 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse23 (* .cse12 4)) (.cse15 (mod (* (* (* (* (+ (- 1) c_~ARR_SIZE~0) |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 ((.cse5 (<= .cse15 2147483647)) (.cse0 (* c_~ARR_SIZE~0 2)) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23))) (and (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 .cse14 (+ .cse15 (- 4294967296)))))) (let ((.cse6 (store (select .cse10 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 .cse12))) (let ((.cse7 (select (store .cse10 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse6) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse1 (select .cse7 .cse9)) (.cse2 (select .cse6 .cse8)) (.cse3 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse1 2 .cse2 .cse3 .cse4)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse1 .cse2 .cse3 .cse4) 0) .cse5))))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 .cse14 .cse15)))) (let ((.cse20 (store (select .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 .cse12))) (let ((.cse21 (select (store .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse20) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse16 (select .cse21 .cse9)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse18 (select .cse21 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse19 (select .cse20 .cse8))) (or (not .cse5) (= .cse0 (+ .cse16 .cse17 |c_ULTIMATE.start_main_~sum~0#1| .cse18 2 .cse19)) (= (+ .cse16 .cse17 |c_ULTIMATE.start_main_~sum~0#1| .cse18 .cse19) 0)))))))))) (<= c_~ARR_SIZE~0 1)) is different from true [2022-07-19 10:10:24,422 WARN L855 $PredicateComparison]: unable to prove that (or (< 2 c_~ARR_SIZE~0) (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) c_~ARR_SIZE~0) (let ((.cse12 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse23 (* .cse12 4)) (.cse15 (mod (* (* (* (* (+ (- 1) c_~ARR_SIZE~0) |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 ((.cse5 (<= .cse15 2147483647)) (.cse0 (* c_~ARR_SIZE~0 2)) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse23)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse14 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse23))) (and (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 .cse14 (+ .cse15 (- 4294967296)))))) (let ((.cse6 (store (select .cse10 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 .cse12))) (let ((.cse7 (select (store .cse10 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse6) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse1 (select .cse7 .cse9)) (.cse2 (select .cse6 .cse8)) (.cse3 (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse1 2 .cse2 .cse3 .cse4)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse1 .cse2 .cse3 .cse4) 0) .cse5))))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse13 .cse14 .cse15)))) (let ((.cse20 (store (select .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 .cse12))) (let ((.cse21 (select (store .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse20) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse16 (select .cse21 .cse9)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse18 (select .cse21 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse19 (select .cse20 .cse8))) (or (not .cse5) (= .cse0 (+ .cse16 .cse17 |c_ULTIMATE.start_main_~sum~0#1| .cse18 2 .cse19)) (= (+ .cse16 .cse17 |c_ULTIMATE.start_main_~sum~0#1| .cse18 .cse19) 0)))))))))) (<= c_~ARR_SIZE~0 1)) is different from true [2022-07-19 10:11:09,804 WARN L233 SmtUtils]: Spent 22.81s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)