./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sum_by_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/sum_by_3.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 cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 15:18:23,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 15:18:23,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 15:18:23,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 15:18:23,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 15:18:23,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 15:18:23,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 15:18:23,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 15:18:23,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 15:18:23,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 15:18:23,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 15:18:23,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 15:18:23,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 15:18:23,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 15:18:23,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 15:18:23,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 15:18:23,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 15:18:23,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 15:18:23,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 15:18:23,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 15:18:23,241 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 15:18:23,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 15:18:23,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 15:18:23,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 15:18:23,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 15:18:23,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 15:18:23,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 15:18:23,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 15:18:23,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 15:18:23,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 15:18:23,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 15:18:23,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 15:18:23,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 15:18:23,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 15:18:23,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 15:18:23,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 15:18:23,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 15:18:23,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 15:18:23,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 15:18:23,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 15:18:23,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 15:18:23,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 15:18:23,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 15:18:23,295 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 15:18:23,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 15:18:23,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 15:18:23,296 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 15:18:23,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 15:18:23,297 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 15:18:23,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 15:18:23,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 15:18:23,298 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 15:18:23,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 15:18:23,299 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 15:18:23,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 15:18:23,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 15:18:23,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 15:18:23,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 15:18:23,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 15:18:23,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 15:18:23,300 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 15:18:23,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 15:18:23,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 15:18:23,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 15:18:23,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 15:18:23,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 15:18:23,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 15:18:23,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:18:23,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 15:18:23,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 15:18:23,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 15:18:23,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 15:18:23,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 15:18:23,303 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 15:18:23,303 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 15:18:23,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 15:18:23,304 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 -> cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b [2022-07-19 15:18:23,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 15:18:23,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 15:18:23,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 15:18:23,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 15:18:23,574 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 15:18:23,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2022-07-19 15:18:23,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90495ca20/a127c289719a4e0ba32a1fb0cd462dc6/FLAG1f53a1065 [2022-07-19 15:18:24,079 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 15:18:24,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2022-07-19 15:18:24,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90495ca20/a127c289719a4e0ba32a1fb0cd462dc6/FLAG1f53a1065 [2022-07-19 15:18:24,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90495ca20/a127c289719a4e0ba32a1fb0cd462dc6 [2022-07-19 15:18:24,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 15:18:24,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 15:18:24,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 15:18:24,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 15:18:24,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 15:18:24,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c349a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24, skipping insertion in model container [2022-07-19 15:18:24,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 15:18:24,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 15:18:24,653 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/loops-crafted-1/sum_by_3.c[406,419] [2022-07-19 15:18:24,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:18:24,683 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 15:18:24,696 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/loops-crafted-1/sum_by_3.c[406,419] [2022-07-19 15:18:24,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:18:24,725 INFO L208 MainTranslator]: Completed translation [2022-07-19 15:18:24,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24 WrapperNode [2022-07-19 15:18:24,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 15:18:24,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 15:18:24,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 15:18:24,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 15:18:24,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,757 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2022-07-19 15:18:24,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 15:18:24,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 15:18:24,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 15:18:24,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 15:18:24,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 15:18:24,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 15:18:24,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 15:18:24,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 15:18:24,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (1/1) ... [2022-07-19 15:18:24,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:18:24,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:18:24,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 15:18:24,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 15:18:24,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 15:18:24,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 15:18:24,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 15:18:24,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 15:18:24,912 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 15:18:24,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 15:18:25,048 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 15:18:25,053 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 15:18:25,053 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 15:18:25,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:18:25 BoogieIcfgContainer [2022-07-19 15:18:25,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 15:18:25,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 15:18:25,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 15:18:25,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 15:18:25,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 03:18:24" (1/3) ... [2022-07-19 15:18:25,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c32a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:18:25, skipping insertion in model container [2022-07-19 15:18:25,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:18:24" (2/3) ... [2022-07-19 15:18:25,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c32a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:18:25, skipping insertion in model container [2022-07-19 15:18:25,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:18:25" (3/3) ... [2022-07-19 15:18:25,065 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2022-07-19 15:18:25,077 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 15:18:25,079 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 15:18:25,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 15:18:25,146 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@6e5c597e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3303aefc [2022-07-19 15:18:25,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 15:18:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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-19 15:18:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 15:18:25,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:18:25,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:18:25,167 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:18:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:18:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1645470860, now seen corresponding path program 1 times [2022-07-19 15:18:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:18:25,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987901789] [2022-07-19 15:18:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:18:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:18:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:18:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:18:25,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:18:25,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987901789] [2022-07-19 15:18:25,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987901789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:18:25,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:18:25,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 15:18:25,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030395823] [2022-07-19 15:18:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:18:25,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 15:18:25,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:18:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 15:18:25,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 15:18:25,357 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-19 15:18:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:18:25,372 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-07-19 15:18:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 15:18:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-07-19 15:18:25,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:18:25,381 INFO L225 Difference]: With dead ends: 28 [2022-07-19 15:18:25,382 INFO L226 Difference]: Without dead ends: 12 [2022-07-19 15:18:25,385 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-19 15:18:25,389 INFO L413 NwaCegarLoop]: 19 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, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:18:25,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:18:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-19 15:18:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-19 15:18:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-19 15:18:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-07-19 15:18:25,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 11 [2022-07-19 15:18:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:18:25,419 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-07-19 15:18:25,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-19 15:18:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-07-19 15:18:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 15:18:25,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:18:25,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:18:25,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 15:18:25,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:18:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:18:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash -26777608, now seen corresponding path program 1 times [2022-07-19 15:18:25,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:18:25,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836364772] [2022-07-19 15:18:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:18:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:18:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:18:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:18:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:18:26,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836364772] [2022-07-19 15:18:26,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836364772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:18:26,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:18:26,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 15:18:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630497221] [2022-07-19 15:18:26,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:18:26,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 15:18:26,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:18:26,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 15:18:26,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:18:26,155 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-19 15:18:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:18:26,322 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-19 15:18:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:18:26,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2022-07-19 15:18:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:18:26,323 INFO L225 Difference]: With dead ends: 33 [2022-07-19 15:18:26,324 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 15:18:26,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-19 15:18:26,325 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:18:26,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 27 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:18:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 15:18:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2022-07-19 15:18:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-19 15:18:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-07-19 15:18:26,332 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2022-07-19 15:18:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:18:26,332 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-19 15:18:26,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-19 15:18:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-07-19 15:18:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 15:18:26,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:18:26,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:18:26,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 15:18:26,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:18:26,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:18:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash 182012736, now seen corresponding path program 1 times [2022-07-19 15:18:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:18:26,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874318534] [2022-07-19 15:18:26,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:18:26,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:18:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:18:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:18:27,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:18:27,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874318534] [2022-07-19 15:18:27,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874318534] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:18:27,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876697121] [2022-07-19 15:18:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:18:27,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:18:27,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:18:27,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:18:27,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 15:18:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:18:27,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 15:18:27,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:18:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:18:28,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:19:11,065 WARN L233 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:19:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:19:11,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876697121] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:19:11,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:19:11,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-07-19 15:19:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495705141] [2022-07-19 15:19:11,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:19:11,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 15:19:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:19:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 15:19:11,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=280, Unknown=10, NotChecked=0, Total=380 [2022-07-19 15:19:11,110 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 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-19 15:19:13,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 15:19:15,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:19:43,562 WARN L233 SmtUtils]: Spent 23.70s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:19:45,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:19:49,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:19:54,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:19:56,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:19:58,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:00,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:03,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:05,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:07,547 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse0 (mod c_~SIZE~0 4294967296))) (and (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| (* |c_ULTIMATE.start_main_~j~0#1| 2)) 4294967296) 3) 4294967296) .cse0) (<= c_~SIZE~0 20000001) (<= (mod (div (mod (+ (* .cse1 2) |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) .cse0) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (or (not (< .cse1 .cse2)) (<= (mod (div (mod (+ (* .cse3 2) |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 3) 4294967296) .cse0) (< .cse3 .cse2))) (<= 20000001 c_~SIZE~0))) is different from false [2022-07-19 15:20:09,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (and (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| (* |c_ULTIMATE.start_main_~j~0#1| 2)) 4294967296) 3) 4294967296) .cse0) (<= .cse1 .cse0) (<= c_~SIZE~0 20000001) (< 0 .cse1) (<= 20000001 c_~SIZE~0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-19 15:20:11,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:18,557 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:20:20,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:22,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:24,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:27,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:29,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:35,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:38,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:40,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:42,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:44,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:46,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:48,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:51,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:53,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:55,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:57,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:20:59,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:21:02,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:21:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:21:02,038 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-07-19 15:21:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 15:21:02,204 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 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) Word has length 12 [2022-07-19 15:21:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:21:02,206 INFO L225 Difference]: With dead ends: 54 [2022-07-19 15:21:02,206 INFO L226 Difference]: Without dead ends: 43 [2022-07-19 15:21:02,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 85.7s TimeCoverageRelationStatistics Valid=262, Invalid=661, Unknown=15, NotChecked=118, Total=1056 [2022-07-19 15:21:02,207 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 101 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 36 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 62.7s IncrementalHoareTripleChecker+Time [2022-07-19 15:21:02,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 44 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 155 Invalid, 29 Unknown, 4 Unchecked, 62.7s Time] [2022-07-19 15:21:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-19 15:21:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 22. [2022-07-19 15:21:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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-19 15:21:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-19 15:21:02,216 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2022-07-19 15:21:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:21:02,216 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-19 15:21:02,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 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-19 15:21:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-07-19 15:21:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 15:21:02,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:21:02,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:21:02,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 15:21:02,419 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-19 15:21:02,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:21:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:21:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -828440446, now seen corresponding path program 1 times [2022-07-19 15:21:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:21:02,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915966452] [2022-07-19 15:21:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:21:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:21:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:21:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:21:02,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:21:02,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915966452] [2022-07-19 15:21:02,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915966452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:21:02,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:21:02,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 15:21:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425964158] [2022-07-19 15:21:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:21:02,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 15:21:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:21:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 15:21:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 15:21:02,514 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-19 15:21:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:21:02,537 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-19 15:21:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 15:21:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-07-19 15:21:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:21:02,539 INFO L225 Difference]: With dead ends: 33 [2022-07-19 15:21:02,539 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 15:21:02,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-19 15:21:02,540 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:21:02,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:21:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 15:21:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 15:21:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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-19 15:21:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-07-19 15:21:02,547 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2022-07-19 15:21:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:21:02,547 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-07-19 15:21:02,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-19 15:21:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-07-19 15:21:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 15:21:02,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:21:02,548 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:21:02,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 15:21:02,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:21:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:21:02,549 INFO L85 PathProgramCache]: Analyzing trace with hash 133150594, now seen corresponding path program 1 times [2022-07-19 15:21:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:21:02,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766177636] [2022-07-19 15:21:02,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:21:02,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:21:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:21:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:21:02,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:21:02,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766177636] [2022-07-19 15:21:02,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766177636] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:21:02,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131276475] [2022-07-19 15:21:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:21:02,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:21:02,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:21:02,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:21:02,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 15:21:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:21:02,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 15:21:02,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:21:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 15:21:02,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:21:02,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131276475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:21:02,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:21:02,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-19 15:21:02,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52682223] [2022-07-19 15:21:02,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:21:02,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 15:21:02,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:21:02,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 15:21:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-19 15:21:02,910 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-19 15:21:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:21:02,958 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-07-19 15:21:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 15:21:02,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-07-19 15:21:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:21:02,959 INFO L225 Difference]: With dead ends: 27 [2022-07-19 15:21:02,960 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 15:21:02,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-19 15:21:02,961 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:21:02,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:21:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 15:21:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-19 15:21:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-19 15:21:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-19 15:21:02,966 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-07-19 15:21:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:21:02,966 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-19 15:21:02,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-19 15:21:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-19 15:21:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 15:21:02,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:21:02,968 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:21:02,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 15:21:03,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:21:03,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:21:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:21:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1728071361, now seen corresponding path program 1 times [2022-07-19 15:21:03,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:21:03,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311151075] [2022-07-19 15:21:03,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:21:03,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:21:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:21:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:21:03,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:21:03,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311151075] [2022-07-19 15:21:03,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311151075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:21:03,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363583989] [2022-07-19 15:21:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:21:03,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:21:03,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:21:03,334 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:21:03,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 15:21:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:21:03,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 15:21:03,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:21:03,760 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-19 15:21:03,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:21:27,711 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (or (not (< (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) .cse0)) (<= (mod (div (mod (+ (* .cse1 2) 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296)) (< .cse1 .cse0))) is different from true [2022-07-19 15:21:38,545 WARN L233 SmtUtils]: Spent 10.70s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:21:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-19 15:21:38,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363583989] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:21:38,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:21:38,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 22 [2022-07-19 15:21:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902180635] [2022-07-19 15:21:38,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:21:38,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 15:21:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:21:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 15:21:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=333, Unknown=7, NotChecked=38, Total=462 [2022-07-19 15:21:38,570 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 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-19 15:21:40,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:21:43,078 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse6 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse2 (not (< .cse0 .cse6))) (.cse4 (< .cse3 .cse6)) (.cse1 (mod c_~SIZE~0 4294967296))) (and (<= (mod (div (mod (+ 2 (* .cse0 2) |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) .cse1) (or .cse2 (<= (mod (div (mod (+ (* .cse3 2) 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) .cse1) .cse4) (let ((.cse5 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (or .cse2 (< .cse5 .cse6) (not .cse4) (<= (mod (div (mod (+ (* 2 .cse5) |c_ULTIMATE.start_main_~i~0#1| 4) 4294967296) 3) 4294967296) .cse1)))))) is different from true [2022-07-19 15:21:45,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:21:51,906 WARN L233 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 49 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:22:00,638 WARN L233 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:22:02,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:22:05,006 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (div |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse1 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse0 (mod c_~SIZE~0 4294967296)) (.cse4 (* .cse3 4294967296))) (and (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| (* |c_ULTIMATE.start_main_~j~0#1| 2)) 4294967296) 3) 4294967296) .cse0) (<= .cse1 .cse0) (< 1 .cse1) (= .cse2 |c_ULTIMATE.start_main_~j~0#1|) (< 0 (+ .cse3 1)) (<= (+ .cse3 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296)) 0) (<= (+ |c_ULTIMATE.start_main_~n~0#1| .cse4) (+ (* (div |c_ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |c_ULTIMATE.start_main_~i~0#1|)) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= |c_ULTIMATE.start_main_~i~0#1| (+ 2147483647 .cse4)) (< (+ (div .cse2 (- 4294967296)) (div (+ (- 2) .cse0) (- 4294967296))) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (= (+ |c_ULTIMATE.start_main_~j~0#1| .cse4) |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2022-07-19 15:22:42,352 WARN L233 SmtUtils]: Spent 22.14s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:22:44,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:22:57,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:22:59,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:23:01,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:23:04,112 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse1 (mod c_~SIZE~0 4294967296))) (and (<= (mod (div (mod (+ 2 (* .cse0 2) |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) .cse1) (<= (mod (div (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1| (* |c_ULTIMATE.start_main_~j~0#1| 2)) 4294967296) 3) 4294967296) .cse1) (let ((.cse2 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse3 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (or (not (< .cse0 .cse2)) (< .cse3 .cse2) (not (< (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) .cse2)) (<= (mod (div (mod (+ (* 2 .cse3) |c_ULTIMATE.start_main_~i~0#1| 4) 4294967296) 3) 4294967296) .cse1))))) is different from true [2022-07-19 15:23:06,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:23:08,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:23:10,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []