./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/mods.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 f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:22:37,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:22:37,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:22:37,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:22:37,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:22:37,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:22:37,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:22:37,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:22:37,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:22:37,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:22:37,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:22:37,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:22:37,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:22:37,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:22:37,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:22:37,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:22:37,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:22:37,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:22:37,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:22:37,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:22:37,243 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:22:37,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:22:37,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:22:37,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:22:37,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:22:37,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:22:37,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:22:37,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:22:37,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:22:37,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:22:37,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:22:37,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:22:37,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:22:37,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:22:37,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:22:37,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:22:37,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:22:37,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:22:37,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:22:37,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:22:37,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:22:37,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:22:37,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:22:37,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:22:37,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:22:37,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:22:37,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:22:37,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:22:37,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:22:37,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:22:37,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:22:37,312 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:22:37,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:22:37,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:22:37,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:22:37,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:22:37,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:22:37,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:22:37,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:22:37,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:22:37,314 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:22:37,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:22:37,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:22:37,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:22:37,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:22:37,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:22:37,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:22:37,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:22:37,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:22:37,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:22:37,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:22:37,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:22:37,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:22:37,316 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:22:37,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:22:37,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:22:37,323 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 -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2022-07-11 23:22:37,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:22:37,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:22:37,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:22:37,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:22:37,601 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:22:37,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/mods.c [2022-07-11 23:22:37,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4147d6bf5/fb8ecba356194419882da07d995236bd/FLAGd7af6be59 [2022-07-11 23:22:38,022 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:22:38,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2022-07-11 23:22:38,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4147d6bf5/fb8ecba356194419882da07d995236bd/FLAGd7af6be59 [2022-07-11 23:22:38,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4147d6bf5/fb8ecba356194419882da07d995236bd [2022-07-11 23:22:38,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:22:38,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:22:38,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:22:38,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:22:38,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:22:38,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa9f91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38, skipping insertion in model container [2022-07-11 23:22:38,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:22:38,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:22:38,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-07-11 23:22:38,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:22:38,613 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:22:38,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-07-11 23:22:38,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:22:38,662 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:22:38,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38 WrapperNode [2022-07-11 23:22:38,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:22:38,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:22:38,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:22:38,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:22:38,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,707 INFO L137 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-07-11 23:22:38,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:22:38,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:22:38,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:22:38,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:22:38,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:22:38,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:22:38,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:22:38,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:22:38,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (1/1) ... [2022-07-11 23:22:38,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:22:38,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:22:38,780 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-11 23:22:38,795 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-11 23:22:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:22:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:22:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:22:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:22:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:22:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:22:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:22:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:22:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:22:38,896 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:22:38,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:22:39,092 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:22:39,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:22:39,097 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-11 23:22:39,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:22:39 BoogieIcfgContainer [2022-07-11 23:22:39,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:22:39,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:22:39,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:22:39,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:22:39,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:22:38" (1/3) ... [2022-07-11 23:22:39,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367f58cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:22:39, skipping insertion in model container [2022-07-11 23:22:39,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:22:38" (2/3) ... [2022-07-11 23:22:39,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367f58cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:22:39, skipping insertion in model container [2022-07-11 23:22:39,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:22:39" (3/3) ... [2022-07-11 23:22:39,113 INFO L111 eAbstractionObserver]: Analyzing ICFG mods.c [2022-07-11 23:22:39,139 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:22:39,140 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:22:39,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:22:39,202 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@5500bd48, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6884375 [2022-07-11 23:22:39,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:22:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 23:22:39,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:22:39,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:22:39,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:22:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:22:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-07-11 23:22:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:22:39,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322192871] [2022-07-11 23:22:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:22:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:22:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:22:39,376 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-11 23:22:39,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:22:39,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322192871] [2022-07-11 23:22:39,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322192871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:22:39,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:22:39,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:22:39,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301322214] [2022-07-11 23:22:39,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:22:39,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:22:39,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:22:39,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:22:39,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:22:39,412 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:22:39,427 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-07-11 23:22:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:22:39,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-11 23:22:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:22:39,436 INFO L225 Difference]: With dead ends: 50 [2022-07-11 23:22:39,436 INFO L226 Difference]: Without dead ends: 23 [2022-07-11 23:22:39,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:22:39,441 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:22:39,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:22:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-11 23:22:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-11 23:22:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-11 23:22:39,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-07-11 23:22:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:22:39,470 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-11 23:22:39,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-11 23:22:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 23:22:39,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:22:39,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:22:39,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:22:39,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:22:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:22:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-07-11 23:22:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:22:39,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838651326] [2022-07-11 23:22:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:22:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:22:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:22:39,606 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-11 23:22:39,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:22:39,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838651326] [2022-07-11 23:22:39,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838651326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:22:39,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:22:39,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:22:39,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925980196] [2022-07-11 23:22:39,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:22:39,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:22:39,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:22:39,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:22:39,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:22:39,612 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:22:39,690 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-07-11 23:22:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:22:39,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-11 23:22:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:22:39,692 INFO L225 Difference]: With dead ends: 53 [2022-07-11 23:22:39,692 INFO L226 Difference]: Without dead ends: 37 [2022-07-11 23:22:39,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:22:39,693 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:22:39,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:22:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-11 23:22:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-07-11 23:22:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-11 23:22:39,700 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-07-11 23:22:39,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:22:39,702 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-11 23:22:39,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-11 23:22:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:22:39,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:22:39,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:22:39,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:22:39,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:22:39,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:22:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-07-11 23:22:39,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:22:39,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503669517] [2022-07-11 23:22:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:22:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:22:39,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:22:39,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803507695] [2022-07-11 23:22:39,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:22:39,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:22:39,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:22:39,767 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-11 23:22:39,805 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-11 23:22:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:22:39,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-11 23:22:39,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:22:39,918 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-11 23:22:39,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:22:39,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-11 23:22:40,025 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 36 treesize of output 23 [2022-07-11 23:22:40,104 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 36 treesize of output 23 [2022-07-11 23:22:40,291 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 121 treesize of output 68 [2022-07-11 23:22:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:22:40,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:22:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:22:41,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:22:41,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503669517] [2022-07-11 23:22:41,139 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:22:41,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803507695] [2022-07-11 23:22:41,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803507695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:22:41,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:22:41,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-07-11 23:22:41,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503570859] [2022-07-11 23:22:41,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:22:41,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-11 23:22:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:22:41,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-11 23:22:41,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-07-11 23:22:41,143 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:22:42,039 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-07-11 23:22:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:22:42,041 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-11 23:22:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:22:42,042 INFO L225 Difference]: With dead ends: 50 [2022-07-11 23:22:42,042 INFO L226 Difference]: Without dead ends: 48 [2022-07-11 23:22:42,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-07-11 23:22:42,044 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:22:42,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 128 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 214 Invalid, 0 Unknown, 11 Unchecked, 0.6s Time] [2022-07-11 23:22:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-11 23:22:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2022-07-11 23:22:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-07-11 23:22:42,051 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 24 [2022-07-11 23:22:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:22:42,052 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-07-11 23:22:42,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-07-11 23:22:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:22:42,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:22:42,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:22:42,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-11 23:22:42,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:22:42,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:22:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:22:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-07-11 23:22:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:22:42,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408404626] [2022-07-11 23:22:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:22:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:22:42,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:22:42,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994542549] [2022-07-11 23:22:42,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:22:42,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:22:42,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:22:42,313 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-11 23:22:42,345 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-11 23:22:42,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:22:42,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:22:42,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:22:42,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:22:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:22:42,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:22:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:22:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:22:42,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408404626] [2022-07-11 23:22:42,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:22:42,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994542549] [2022-07-11 23:22:42,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994542549] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:22:42,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:22:42,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-11 23:22:42,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269796578] [2022-07-11 23:22:42,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:22:42,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:22:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:22:42,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:22:42,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:22:42,506 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:22:42,655 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-07-11 23:22:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:22:42,656 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-11 23:22:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:22:42,657 INFO L225 Difference]: With dead ends: 106 [2022-07-11 23:22:42,657 INFO L226 Difference]: Without dead ends: 61 [2022-07-11 23:22:42,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:22:42,658 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:22:42,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 55 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:22:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-11 23:22:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-07-11 23:22:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-11 23:22:42,680 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 26 [2022-07-11 23:22:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:22:42,680 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-11 23:22:42,680 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-11 23:22:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:22:42,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:22:42,681 INFO L195 NwaCegarLoop]: trace histogram [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-11 23:22:42,730 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-11 23:22:42,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-11 23:22:42,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:22:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:22:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -756951010, now seen corresponding path program 3 times [2022-07-11 23:22:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:22:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583113836] [2022-07-11 23:22:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:22:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:22:42,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:22:42,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677528688] [2022-07-11 23:22:42,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:22:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:22:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:22:42,959 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-11 23:22:42,975 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-11 23:22:43,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:22:43,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:22:43,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:22:43,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:22:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:22:43,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:22:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:22:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:22:43,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583113836] [2022-07-11 23:22:43,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:22:43,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677528688] [2022-07-11 23:22:43,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677528688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:22:43,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:22:43,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-11 23:22:43,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678300820] [2022-07-11 23:22:43,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:22:43,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:22:43,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:22:43,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:22:43,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:22:43,129 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:22:43,265 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-07-11 23:22:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:22:43,266 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-11 23:22:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:22:43,269 INFO L225 Difference]: With dead ends: 59 [2022-07-11 23:22:43,269 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:22:43,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 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-11 23:22:43,276 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:22:43,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 38 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:22:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:22:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-07-11 23:22:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-11 23:22:43,289 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2022-07-11 23:22:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:22:43,289 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-11 23:22:43,290 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:22:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-11 23:22:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:22:43,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:22:43,291 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:22:43,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-11 23:22:43,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:22:43,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:22:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:22:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-07-11 23:22:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:22:43,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030472439] [2022-07-11 23:22:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:22:43,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:22:43,539 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:22:43,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1630914333] [2022-07-11 23:22:43,539 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:22:43,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:22:43,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:22:43,541 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-11 23:22:43,563 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-11 23:22:43,611 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:22:43,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:22:43,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-11 23:22:43,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:22:43,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:22:43,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:43,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:22:43,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:43,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:43,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-11 23:22:43,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:43,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:22:43,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:43,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-07-11 23:22:43,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:43,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:43,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2022-07-11 23:22:43,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:43,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:22:43,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:43,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-07-11 23:22:44,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:44,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:44,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:44,047 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-11 23:22:44,047 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 1 case distinctions, treesize of input 53 treesize of output 54 [2022-07-11 23:22:44,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:44,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:22:44,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 129 [2022-07-11 23:22:44,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:44,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:44,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2022-07-11 23:22:44,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:22:44,370 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 53 treesize of output 29 [2022-07-11 23:22:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:22:44,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:22:46,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)) (forall ((v_ArrVal_191 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-11 23:22:47,312 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (< .cse14 0))) (let ((.cse4 (not .cse3)) (.cse1 (= (mod .cse13 .cse14) 0)) (.cse0 (< .cse13 0))) (and (or (and .cse0 (not .cse1)) (let ((.cse2 (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_191 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse6 (mod (select .cse5 .cse6) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (and (or .cse2 .cse3) (or .cse2 .cse4)))) (or (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_191 Int)) (or (= (select (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (- 1) (mod (select .cse7 .cse8) (+ .cse9 1)) (* (- 1) .cse9))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) .cse3) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_191 Int)) (or (= (select (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse10 .cse11 (let ((.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse12 (mod (select .cse10 .cse11) (+ .cse12 1)) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) .cse4)) .cse1 (not .cse0)))))) is different from false [2022-07-11 23:23:00,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 Int) (v_ArrVal_182 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (mod (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) 0)))) is different from false [2022-07-11 23:23:02,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 Int) (v_ArrVal_182 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (mod (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) 0)))) is different from false [2022-07-11 23:23:04,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_180)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (<= (+ v_ArrVal_180 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse2 (store (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (mod (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) 0)))) is different from false [2022-07-11 23:23:06,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (<= (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_180)) (not (<= (+ v_ArrVal_180 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (mod (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) 0)))) is different from false [2022-07-11 23:23:09,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_179))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (<= (+ v_ArrVal_180 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (= (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse2 (store (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (mod (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) 0) (not (<= 1 v_ArrVal_179)) (not (<= (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_180))))))) is different from false [2022-07-11 23:23:11,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_179))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_180)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (= (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse2 (store (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (mod (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) 0) (not (<= (+ v_ArrVal_180 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (not (<= 1 v_ArrVal_179))))))) is different from false [2022-07-11 23:23:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-11 23:23:15,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:23:15,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030472439] [2022-07-11 23:23:15,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:23:15,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630914333] [2022-07-11 23:23:15,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630914333] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:23:15,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:23:15,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2022-07-11 23:23:15,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215460576] [2022-07-11 23:23:15,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:23:15,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-11 23:23:15,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:23:15,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-11 23:23:15,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=645, Unknown=12, NotChecked=472, Total=1260 [2022-07-11 23:23:15,976 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:23:39,641 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (forall ((v_ArrVal_186 Int)) (= (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (mod (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_71|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ (- 1) .cse1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 3 .cse1))) is different from false [2022-07-11 23:23:46,169 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (<= 2 .cse0) (= (let ((.cse1 (+ .cse0 1))) (mod .cse1 .cse1)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) (<= 0 .cse2) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)) (forall ((v_ArrVal_191 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse2 1)) 0))) is different from false [2022-07-11 23:23:47,037 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse15 (select .cse13 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (< .cse14 0))) (let ((.cse4 (not .cse3)) (.cse1 (= (mod .cse15 .cse14) 0)) (.cse0 (< .cse15 0))) (and (or (and .cse0 (not .cse1)) (let ((.cse2 (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_191 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse6 (mod (select .cse5 .cse6) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (and (or .cse2 .cse3) (or .cse2 .cse4)))) (or (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_191 Int)) (or (= (select (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (- 1) (mod (select .cse7 .cse8) (+ .cse9 1)) (* (- 1) .cse9))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) .cse3) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_191 Int)) (or (= (select (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse10 .cse11 (let ((.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse12 (mod (select .cse10 .cse11) (+ .cse12 1)) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) .cse4)) .cse1 (not .cse0)) (= (mod (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse14) 0))))) is different from false [2022-07-11 23:23:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:23:47,088 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-07-11 23:23:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-11 23:23:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-11 23:23:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:23:47,090 INFO L225 Difference]: With dead ends: 85 [2022-07-11 23:23:47,090 INFO L226 Difference]: Without dead ends: 83 [2022-07-11 23:23:47,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 61.3s TimeCoverageRelationStatistics Valid=189, Invalid=1026, Unknown=19, NotChecked=836, Total=2070 [2022-07-11 23:23:47,092 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 513 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:23:47,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 194 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 190 Invalid, 0 Unknown, 513 Unchecked, 0.3s Time] [2022-07-11 23:23:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-11 23:23:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2022-07-11 23:23:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:23:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-07-11 23:23:47,103 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 32 [2022-07-11 23:23:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:23:47,103 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-07-11 23:23:47,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:23:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-07-11 23:23:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:23:47,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:23:47,105 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:23:47,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-11 23:23:47,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:23:47,312 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:23:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:23:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2147373800, now seen corresponding path program 5 times [2022-07-11 23:23:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:23:47,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375725097] [2022-07-11 23:23:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:23:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:23:47,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:23:47,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272822551] [2022-07-11 23:23:47,334 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:23:47,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:23:47,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:23:47,335 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-11 23:23:47,371 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-11 23:23:47,481 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:23:47,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:23:47,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:23:47,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:23:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:23:47,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:23:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:23:47,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:23:47,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375725097] [2022-07-11 23:23:47,618 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:23:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272822551] [2022-07-11 23:23:47,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272822551] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:23:47,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:23:47,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-11 23:23:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215220373] [2022-07-11 23:23:47,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:23:47,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:23:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:23:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:23:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:23:47,620 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:23:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:23:47,811 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2022-07-11 23:23:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:23:47,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-11 23:23:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:23:47,812 INFO L225 Difference]: With dead ends: 159 [2022-07-11 23:23:47,812 INFO L226 Difference]: Without dead ends: 124 [2022-07-11 23:23:47,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:23:47,813 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 91 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:23:47,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 71 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:23:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-11 23:23:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2022-07-11 23:23:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.1333333333333333) internal successors, (102), 90 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:23:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-07-11 23:23:47,828 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 34 [2022-07-11 23:23:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:23:47,828 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-07-11 23:23:47,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:23:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-07-11 23:23:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:23:47,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:23:47,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:23:47,848 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-11 23:23:48,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:23:48,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:23:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:23:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-07-11 23:23:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:23:48,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733379499] [2022-07-11 23:23:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:23:48,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:23:48,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:23:48,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104986612] [2022-07-11 23:23:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:23:48,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:23:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:23:48,090 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-11 23:23:48,091 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-11 23:23:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:23:48,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-11 23:23:48,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:23:48,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:23:48,205 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-11 23:23:48,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:23:48,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:23:48,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-11 23:23:48,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:23:48,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:23:48,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-11 23:23:48,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:23:48,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2022-07-11 23:23:48,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:23:48,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:23:48,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2022-07-11 23:23:48,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:23:48,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 39 [2022-07-11 23:23:48,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:23:48,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:23:48,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 105 [2022-07-11 23:23:48,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:23:48,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-07-11 23:23:49,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2022-07-11 23:23:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:23:49,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:24:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:24:27,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:24:27,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733379499] [2022-07-11 23:24:27,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:24:27,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104986612] [2022-07-11 23:24:27,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104986612] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:24:27,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:24:27,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-07-11 23:24:27,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146864739] [2022-07-11 23:24:27,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:24:27,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-11 23:24:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:24:27,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-11 23:24:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1384, Unknown=3, NotChecked=0, Total=1722 [2022-07-11 23:24:27,648 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 42 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:24:33,869 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse90 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (+ .cse90 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse26 .cse27))) (let ((.cse31 (+ .cse8 .cse9))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31))) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (+ .cse8 1)) (.cse35 (+ .cse8 .cse39)) (.cse37 (select .cse26 .cse6)) (.cse23 (store .cse26 .cse27 1)) (.cse7 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (+ .cse90 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (let ((.cse4 (+ .cse8 .cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse1 (+ (select .cse7 .cse6) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse3 (store .cse5 .cse6 .cse1))) (let ((.cse0 (mod .cse4 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse0 0)) (= (mod .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))) (let ((.cse22 (store .cse23 .cse24 1))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse11 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse19))))) (let ((.cse16 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (+ .cse17 .cse18 .cse19 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14))) (let ((.cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse6)))) (let ((.cse12 (store .cse15 .cse6 .cse10))) (let ((.cse13 (mod .cse14 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse13 0))))))))))))))) (let ((.cse25 (store .cse26 .cse27 (mod .cse9 .cse28)))) (or (= (select .cse25 .cse6) 0) (not (= (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (let ((.cse30 (store .cse26 .cse27 .cse31))) (let ((.cse29 (mod (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse29 0)) (= (mod (select .cse30 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse36 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse35))) (let ((.cse32 (+ .cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse33 (store .cse36 .cse6 .cse32))) (let ((.cse34 (mod .cse35 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse32 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| .cse34)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse34 0))))))) (let ((.cse38 (mod .cse39 .cse28))) (or (not (= .cse38 0)) (= (mod .cse37 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse47 (select .cse26 .cse24))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse47))))) (let ((.cse46 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (+ .cse8 .cse47 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44))) (let ((.cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse46 .cse6)))) (let ((.cse42 (store .cse45 .cse6 .cse40))) (let ((.cse43 (mod .cse44 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| .cse43)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse43 0))))))))))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse35)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse56 .cse39))))) (let ((.cse55 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse53 (+ .cse8 .cse56 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse39))) (let ((.cse54 (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse53))) (let ((.cse50 (+ (select .cse55 .cse6) (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse52 (store .cse54 .cse6 .cse50))) (let ((.cse49 (mod .cse53 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse52) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse49 0)) (= (mod .cse50 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| .cse49)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))) (or (not (= 0 .cse39)) (= .cse37 0)) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse58 (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse65 .cse66))))) (let ((.cse63 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse61 (+ .cse64 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse65 .cse66))) (let ((.cse62 (store .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| .cse61))) (let ((.cse57 (+ (select .cse63 .cse6) (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse59 (store .cse62 .cse6 .cse57))) (let ((.cse60 (mod .cse61 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse57 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| .cse60)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse60 0)))))))))))))) (let ((.cse81 (store .cse26 .cse24 1))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse71 (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78))))) (let ((.cse75 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse73 (+ (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse76 .cse77 .cse78))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.offset| .cse73))) (let ((.cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse75 .cse6)))) (let ((.cse72 (store .cse74 .cse6 .cse70))) (let ((.cse69 (mod .cse73 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse69 0)) (= (mod .cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| .cse69)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))))))) (let ((.cse89 (select .cse7 .cse24))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse89))))) (let ((.cse88 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse86 (+ .cse8 .cse9 (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse89))) (let ((.cse87 (store .cse88 |c_ULTIMATE.start_main_~a~0#1.offset| .cse86))) (let ((.cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse88 .cse6)))) (let ((.cse85 (store .cse87 .cse6 .cse83))) (let ((.cse82 (mod .cse86 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse85) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse82 0)) (= (mod .cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| .cse82)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))))))))))) is different from false [2022-07-11 23:24:35,881 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse90 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (+ .cse90 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse26 .cse27))) (let ((.cse31 (+ .cse8 .cse9))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31))) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (+ .cse8 1)) (.cse35 (+ .cse8 .cse39)) (.cse37 (select .cse26 .cse6)) (.cse23 (store .cse26 .cse27 1)) (.cse7 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (+ .cse90 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (let ((.cse4 (+ .cse8 .cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse1 (+ (select .cse7 .cse6) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse3 (store .cse5 .cse6 .cse1))) (let ((.cse0 (mod .cse4 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse0 0)) (= (mod .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))) (let ((.cse22 (store .cse23 .cse24 1))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse11 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse19))))) (let ((.cse16 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (+ .cse17 .cse18 .cse19 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14))) (let ((.cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse6)))) (let ((.cse12 (store .cse15 .cse6 .cse10))) (let ((.cse13 (mod .cse14 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse13 0))))))))))))))) (let ((.cse25 (store .cse26 .cse27 (mod .cse9 .cse28)))) (or (= (select .cse25 .cse6) 0) (not (= (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (let ((.cse30 (store .cse26 .cse27 .cse31))) (let ((.cse29 (mod (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse29 0)) (= (mod (select .cse30 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse36 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse35))) (let ((.cse32 (+ .cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse33 (store .cse36 .cse6 .cse32))) (let ((.cse34 (mod .cse35 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse32 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| .cse34)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse34 0))))))) (let ((.cse38 (mod .cse39 .cse28))) (or (not (= .cse38 0)) (= (mod .cse37 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse47 (select .cse26 .cse24))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse47))))) (let ((.cse46 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (+ .cse8 .cse47 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44))) (let ((.cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse46 .cse6)))) (let ((.cse42 (store .cse45 .cse6 .cse40))) (let ((.cse43 (mod .cse44 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| .cse43)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse43 0))))))))))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse35)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse56 .cse39))))) (let ((.cse55 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse53 (+ .cse8 .cse56 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse39))) (let ((.cse54 (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse53))) (let ((.cse50 (+ (select .cse55 .cse6) (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse52 (store .cse54 .cse6 .cse50))) (let ((.cse49 (mod .cse53 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse52) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse49 0)) (= (mod .cse50 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| .cse49)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))) (or (not (= 0 .cse39)) (= .cse37 0)) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse58 (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse65 .cse66))))) (let ((.cse63 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse61 (+ .cse64 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse65 .cse66))) (let ((.cse62 (store .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| .cse61))) (let ((.cse57 (+ (select .cse63 .cse6) (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse59 (store .cse62 .cse6 .cse57))) (let ((.cse60 (mod .cse61 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse57 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| .cse60)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse60 0)))))))))))))) (let ((.cse81 (store .cse26 .cse24 1))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse71 (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78))))) (let ((.cse75 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse73 (+ (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse76 .cse77 .cse78))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.offset| .cse73))) (let ((.cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse75 .cse6)))) (let ((.cse72 (store .cse74 .cse6 .cse70))) (let ((.cse69 (mod .cse73 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse69 0)) (= (mod .cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| .cse69)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))))))) (let ((.cse89 (select .cse7 .cse24))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse89))))) (let ((.cse88 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse86 (+ .cse8 .cse9 (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse89))) (let ((.cse87 (store .cse88 |c_ULTIMATE.start_main_~a~0#1.offset| .cse86))) (let ((.cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse88 .cse6)))) (let ((.cse85 (store .cse87 .cse6 .cse83))) (let ((.cse82 (mod .cse86 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse85) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse82 0)) (= (mod .cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| .cse82)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))))))))))) is different from true [2022-07-11 23:25:21,695 WARN L233 SmtUtils]: Spent 10.69s on a formula simplification. DAG size of input: 214 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:25:24,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:25:26,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:25:28,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:25:34,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:25:48,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:26:33,400 WARN L233 SmtUtils]: Spent 11.83s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:26:38,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:26:40,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:26:43,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:26:55,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:26:57,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []