./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/bresenham-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/nla-digbench/bresenham-ll.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 68505a1040934ea3cdccf61a3fb1a3debf8c6c64330c175637d96b2737c92d5f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:59:41,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:59:41,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:59:41,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:59:41,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:59:41,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:59:41,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:59:41,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:59:41,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:59:41,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:59:41,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:59:41,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:59:41,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:59:41,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:59:41,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:59:41,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:59:41,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:59:41,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:59:41,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:59:41,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:59:41,371 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:59:41,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:59:41,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:59:41,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:59:41,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:59:41,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:59:41,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:59:41,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:59:41,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:59:41,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:59:41,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:59:41,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:59:41,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:59:41,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:59:41,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:59:41,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:59:41,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:59:41,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:59:41,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:59:41,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:59:41,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:59:41,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:59:41,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:59:41,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:59:41,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:59:41,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:59:41,416 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:59:41,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:59:41,417 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:59:41,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:59:41,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:59:41,418 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:59:41,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:59:41,419 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:59:41,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:59:41,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:59:41,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:59:41,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:59:41,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:59:41,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:59:41,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:59:41,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:59:41,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:59:41,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:59:41,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:59:41,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:59:41,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:59:41,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:59:41,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:59:41,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:59:41,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:59:41,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:59:41,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:59:41,433 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:59:41,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:59:41,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:59:41,434 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 -> 68505a1040934ea3cdccf61a3fb1a3debf8c6c64330c175637d96b2737c92d5f [2022-07-21 02:59:41,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:59:41,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:59:41,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:59:41,720 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:59:41,721 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:59:41,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/bresenham-ll.c [2022-07-21 02:59:41,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd83de384/0a17b688ed7f4af8b48a58f5b90f3690/FLAGc619c3d48 [2022-07-21 02:59:42,112 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:59:42,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/bresenham-ll.c [2022-07-21 02:59:42,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd83de384/0a17b688ed7f4af8b48a58f5b90f3690/FLAGc619c3d48 [2022-07-21 02:59:42,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd83de384/0a17b688ed7f4af8b48a58f5b90f3690 [2022-07-21 02:59:42,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:59:42,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:59:42,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:59:42,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:59:42,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:59:42,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7c16c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42, skipping insertion in model container [2022-07-21 02:59:42,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:59:42,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:59:42,635 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/nla-digbench/bresenham-ll.c[597,610] [2022-07-21 02:59:42,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:59:42,654 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:59:42,661 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/nla-digbench/bresenham-ll.c[597,610] [2022-07-21 02:59:42,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:59:42,688 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:59:42,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42 WrapperNode [2022-07-21 02:59:42,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:59:42,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:59:42,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:59:42,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:59:42,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,731 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-07-21 02:59:42,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:59:42,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:59:42,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:59:42,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:59:42,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:59:42,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:59:42,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:59:42,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:59:42,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (1/1) ... [2022-07-21 02:59:42,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:59:42,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:59:42,789 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-21 02:59:42,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-21 02:59:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:59:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:59:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:59:42,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:59:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 02:59:42,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 02:59:42,855 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:59:42,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:59:42,986 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:59:42,989 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:59:43,007 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 02:59:43,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:59:43 BoogieIcfgContainer [2022-07-21 02:59:43,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:59:43,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:59:43,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:59:43,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:59:43,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:59:42" (1/3) ... [2022-07-21 02:59:43,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccb9a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:59:43, skipping insertion in model container [2022-07-21 02:59:43,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:42" (2/3) ... [2022-07-21 02:59:43,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccb9a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:59:43, skipping insertion in model container [2022-07-21 02:59:43,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:59:43" (3/3) ... [2022-07-21 02:59:43,028 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll.c [2022-07-21 02:59:43,038 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:59:43,051 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:59:43,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:59:43,104 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@29968729, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@75ecb377 [2022-07-21 02:59:43,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:59:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:59:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 02:59:43,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:59:43,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:59:43,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:59:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:59:43,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1811601823, now seen corresponding path program 1 times [2022-07-21 02:59:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:59:43,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780229516] [2022-07-21 02:59:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:59:43,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 02:59:43,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019668882] [2022-07-21 02:59:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:59:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:59:43,222 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-21 02:59:43,224 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-21 02:59:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:43,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 02:59:43,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:59:43,405 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-21 02:59:43,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:59:43,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:59:43,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780229516] [2022-07-21 02:59:43,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 02:59:43,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019668882] [2022-07-21 02:59:43,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019668882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:59:43,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:59:43,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:59:43,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195180205] [2022-07-21 02:59:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:59:43,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:59:43,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:59:43,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:59:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:59:43,436 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:59:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:59:43,530 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-07-21 02:59:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:59:43,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 02:59:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:59:43,538 INFO L225 Difference]: With dead ends: 50 [2022-07-21 02:59:43,539 INFO L226 Difference]: Without dead ends: 23 [2022-07-21 02:59:43,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:59:43,550 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:59:43,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:59:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-21 02:59:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-21 02:59:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:59:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-21 02:59:43,582 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 7 [2022-07-21 02:59:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:59:43,583 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-21 02:59:43,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:59:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-21 02:59:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 02:59:43,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:59:43,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:59:43,604 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-21 02:59:43,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-21 02:59:43,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:59:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:59:43,796 INFO L85 PathProgramCache]: Analyzing trace with hash -343010020, now seen corresponding path program 1 times [2022-07-21 02:59:43,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:59:43,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759541499] [2022-07-21 02:59:43,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:43,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:59:43,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 02:59:43,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564049311] [2022-07-21 02:59:43,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:43,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:59:43,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:59:43,808 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-21 02:59:43,811 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-21 02:59:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:43,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 02:59:43,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:59:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:59:43,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:59:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:59:44,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:59:44,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759541499] [2022-07-21 02:59:44,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 02:59:44,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564049311] [2022-07-21 02:59:44,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564049311] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:59:44,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:59:44,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-07-21 02:59:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032922023] [2022-07-21 02:59:44,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:59:44,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 02:59:44,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:59:44,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 02:59:44,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 02:59:44,044 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:59:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:59:44,293 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-07-21 02:59:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 02:59:44,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-07-21 02:59:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:59:44,294 INFO L225 Difference]: With dead ends: 36 [2022-07-21 02:59:44,294 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:59:44,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-21 02:59:44,295 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:59:44,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 43 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 02:59:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:59:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-07-21 02:59:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:59:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-21 02:59:44,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2022-07-21 02:59:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:59:44,300 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-21 02:59:44,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:59:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-07-21 02:59:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 02:59:44,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:59:44,302 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:59:44,320 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-21 02:59:44,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-21 02:59:44,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:59:44,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:59:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1156539182, now seen corresponding path program 1 times [2022-07-21 02:59:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:59:44,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324025382] [2022-07-21 02:59:44,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:44,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:59:44,537 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 02:59:44,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1988513845] [2022-07-21 02:59:44,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:44,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:59:44,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:59:44,539 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-21 02:59:44,540 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-21 02:59:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:44,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 02:59:44,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:59:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:59:44,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:59:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:59:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:59:45,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324025382] [2022-07-21 02:59:45,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 02:59:45,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988513845] [2022-07-21 02:59:45,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988513845] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:59:45,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:59:45,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-07-21 02:59:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397189314] [2022-07-21 02:59:45,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:59:45,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 02:59:45,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:59:45,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 02:59:45,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-21 02:59:45,192 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 02:59:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:59:45,633 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-21 02:59:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 02:59:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-07-21 02:59:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:59:45,634 INFO L225 Difference]: With dead ends: 48 [2022-07-21 02:59:45,634 INFO L226 Difference]: Without dead ends: 40 [2022-07-21 02:59:45,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 02:59:45,636 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:59:45,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 54 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 291 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2022-07-21 02:59:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-21 02:59:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2022-07-21 02:59:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:59:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-21 02:59:45,641 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2022-07-21 02:59:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:59:45,642 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-21 02:59:45,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 02:59:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-07-21 02:59:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 02:59:45,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:59:45,642 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:59:45,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 02:59:45,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:59:45,843 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:59:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:59:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2047060753, now seen corresponding path program 1 times [2022-07-21 02:59:45,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:59:45,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496228879] [2022-07-21 02:59:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:59:45,850 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 02:59:45,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718378929] [2022-07-21 02:59:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:45,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:59:45,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:59:45,852 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-21 02:59:45,853 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-21 02:59:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:45,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 02:59:45,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:59:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 02:59:56,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:59:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 02:59:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:59:56,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496228879] [2022-07-21 02:59:56,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 02:59:56,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718378929] [2022-07-21 02:59:56,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718378929] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:59:56,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:59:56,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-07-21 02:59:56,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374797278] [2022-07-21 02:59:56,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:59:56,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 02:59:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:59:56,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 02:59:56,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2022-07-21 02:59:56,580 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 14 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:59:58,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:00:02,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:00:04,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:00:06,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:00:08,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:00:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:00:10,953 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-07-21 03:00:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 03:00:10,954 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-07-21 03:00:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:00:10,954 INFO L225 Difference]: With dead ends: 44 [2022-07-21 03:00:10,954 INFO L226 Difference]: Without dead ends: 38 [2022-07-21 03:00:10,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=66, Invalid=237, Unknown=3, NotChecked=0, Total=306 [2022-07-21 03:00:10,955 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 14 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:00:10,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 47 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 126 Invalid, 5 Unknown, 0 Unchecked, 10.1s Time] [2022-07-21 03:00:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-21 03:00:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-21 03:00:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 03:00:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-07-21 03:00:10,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 32 [2022-07-21 03:00:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:00:10,966 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-07-21 03:00:10,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 03:00:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-07-21 03:00:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 03:00:10,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:00:10,968 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:00:10,986 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-21 03:00:11,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:00:11,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:00:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:00:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash 241622419, now seen corresponding path program 1 times [2022-07-21 03:00:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:00:11,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908299387] [2022-07-21 03:00:11,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:00:11,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:00:11,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:00:11,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311581713] [2022-07-21 03:00:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:00:11,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:00:11,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:00:11,185 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-21 03:00:11,186 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-21 03:00:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:00:11,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 03:00:11,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:00:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 03:00:11,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:00:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 03:00:11,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:00:11,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908299387] [2022-07-21 03:00:11,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:00:11,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311581713] [2022-07-21 03:00:11,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311581713] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:00:11,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:00:11,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-21 03:00:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556336673] [2022-07-21 03:00:11,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:00:11,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 03:00:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:00:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 03:00:11,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-21 03:00:11,467 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 03:00:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:00:11,633 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-07-21 03:00:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 03:00:11,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2022-07-21 03:00:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:00:11,634 INFO L225 Difference]: With dead ends: 53 [2022-07-21 03:00:11,634 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 03:00:11,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-21 03:00:11,635 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:00:11,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 75 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:00:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 03:00:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2022-07-21 03:00:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 03:00:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-07-21 03:00:11,642 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 32 [2022-07-21 03:00:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:00:11,643 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-07-21 03:00:11,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 03:00:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-07-21 03:00:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 03:00:11,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:00:11,644 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:00:11,665 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-21 03:00:11,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:00:11,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:00:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:00:11,845 INFO L85 PathProgramCache]: Analyzing trace with hash 662280374, now seen corresponding path program 2 times [2022-07-21 03:00:11,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:00:11,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710725971] [2022-07-21 03:00:11,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:00:11,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:00:11,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:00:11,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429725593] [2022-07-21 03:00:11,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:00:11,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:00:11,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:00:11,860 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-21 03:00:11,861 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-21 03:00:11,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:00:11,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:00:11,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 03:00:11,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:00:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 03:00:12,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:00:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 03:00:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:00:12,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710725971] [2022-07-21 03:00:12,137 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:00:12,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429725593] [2022-07-21 03:00:12,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429725593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:00:12,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:00:12,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-21 03:00:12,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930912823] [2022-07-21 03:00:12,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:00:12,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 03:00:12,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:00:12,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 03:00:12,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-07-21 03:00:12,139 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 03:00:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:00:12,306 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-07-21 03:00:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 03:00:12,306 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 41 [2022-07-21 03:00:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:00:12,307 INFO L225 Difference]: With dead ends: 66 [2022-07-21 03:00:12,307 INFO L226 Difference]: Without dead ends: 60 [2022-07-21 03:00:12,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-21 03:00:12,308 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:00:12,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:00:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-21 03:00:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-07-21 03:00:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 03:00:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-07-21 03:00:12,316 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 41 [2022-07-21 03:00:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:00:12,316 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-07-21 03:00:12,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 03:00:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-07-21 03:00:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 03:00:12,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:00:12,317 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:00:12,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 03:00:12,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:00:12,518 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:00:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:00:12,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1552488974, now seen corresponding path program 3 times [2022-07-21 03:00:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:00:12,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162050466] [2022-07-21 03:00:12,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:00:12,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:00:12,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:00:12,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182360728] [2022-07-21 03:00:12,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 03:00:12,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:00:12,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:00:12,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:00:12,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 03:00:13,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-21 03:00:13,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:00:13,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 03:00:13,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:00:16,851 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~X~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~Y~0#1| 0)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~y~0#1| (- 2) |c_ULTIMATE.start_main_~X~0#1|)) 2) 0)) (.cse3 (+ (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~X~0#1|) (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) (- 2))))) (or (and (let ((.cse2 (= |c_ULTIMATE.start_main_~y~0#1| 0))) (or (let ((.cse0 (div |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse0)) (= (mod |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|) 0) (<= .cse0 .cse1) (not (<= .cse0 |c_ULTIMATE.start_main_~X~0#1|)) (not .cse2))) (and (= |c_ULTIMATE.start_main_~xy~0#1| 0) (= |c_ULTIMATE.start_main_~yx~0#1| 0) .cse2))) (= .cse3 0) .cse4 .cse5) (let ((.cse6 (div .cse3 |c_ULTIMATE.start_main_~Y~0#1|))) (and (<= .cse6 .cse1) (not .cse5) (= |c_ULTIMATE.start_main_~xy~0#1| (* |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse6)) (not (<= .cse6 |c_ULTIMATE.start_main_~X~0#1|)) .cse4 (= (mod .cse3 |c_ULTIMATE.start_main_~Y~0#1|) 0))))) is different from false [2022-07-21 03:01:38,026 WARN L833 $PredicateComparison]: unable to prove that (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17| Int) (|aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141| Int) (|aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| Int)) (let ((.cse0 (* 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse11 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2))) (let ((.cse2 (+ .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse5 (+ (* (- 1) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (* (- 1) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) .cse0)) (.cse6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse9 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse4 (+ (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse7 (* (- 1) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|)) (.cse8 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (.cse1 (+ (* |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| 2) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse3 (+ 2 .cse0))) (and (<= .cse0 .cse1) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (< |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| 2) (< .cse2 .cse3) (<= .cse0 .cse4) (<= .cse0 .cse2) (= (mod (+ |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (- 2) .cse5)) 2) 0) (not (= |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 0)) (<= (+ (div (+ .cse6 .cse7 .cse8 .cse9 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) (+ .cse0 1)) (= (mod (+ |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse5) .cse7) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) 0) (< .cse0 (+ (div (+ .cse6 |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| .cse7 .cse8 .cse9) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (< .cse4 .cse3) (not (let ((.cse12 (* (- 2) |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) (let ((.cse10 (div (+ .cse7 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| .cse8 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2) (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (+ .cse12 .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|))) (= (+ (* (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse10) 2) .cse11) (+ .cse12 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 2) (* 2 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| .cse10)) .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2)))))) (< .cse1 .cse3))))))) is different from false [2022-07-21 03:03:01,263 WARN L833 $PredicateComparison]: unable to prove that (or (<= 1 c___VERIFIER_assert_~cond) (and (<= 0 c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17| Int) (|aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141| Int) (|aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| Int)) (let ((.cse0 (* 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse11 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2))) (let ((.cse2 (+ .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse5 (+ (* (- 1) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (* (- 1) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) .cse0)) (.cse6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse9 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse4 (+ (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse7 (* (- 1) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|)) (.cse8 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (.cse1 (+ (* |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| 2) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse3 (+ 2 .cse0))) (and (<= .cse0 .cse1) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (< |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| 2) (< .cse2 .cse3) (<= .cse0 .cse4) (<= .cse0 .cse2) (= (mod (+ |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (- 2) .cse5)) 2) 0) (not (= |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 0)) (<= (+ (div (+ .cse6 .cse7 .cse8 .cse9 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) (+ .cse0 1)) (= (mod (+ |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse5) .cse7) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) 0) (< .cse0 (+ (div (+ .cse6 |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| .cse7 .cse8 .cse9) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (< .cse4 .cse3) (not (let ((.cse12 (* (- 2) |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) (let ((.cse10 (div (+ .cse7 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| .cse8 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2) (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (+ .cse12 .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|))) (= (+ (* (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse10) 2) .cse11) (+ .cse12 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 2) (* 2 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| .cse10)) .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2)))))) (< .cse1 .cse3))))))) is different from false [2022-07-21 03:03:45,482 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17| Int) (|aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141| Int) (|aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| Int)) (let ((.cse0 (* 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse11 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2))) (let ((.cse2 (+ .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse5 (+ (* (- 1) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (* (- 1) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) .cse0)) (.cse6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse9 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse4 (+ (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse7 (* (- 1) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|)) (.cse8 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (.cse1 (+ (* |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| 2) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse3 (+ 2 .cse0))) (and (<= .cse0 .cse1) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (< |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| 2) (< .cse2 .cse3) (<= .cse0 .cse4) (<= .cse0 .cse2) (= (mod (+ |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (- 2) .cse5)) 2) 0) (not (= |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 0)) (<= (+ (div (+ .cse6 .cse7 .cse8 .cse9 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) (+ .cse0 1)) (= (mod (+ |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse5) .cse7) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) 0) (< .cse0 (+ (div (+ .cse6 |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| .cse7 .cse8 .cse9) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (< .cse4 .cse3) (not (let ((.cse12 (* (- 2) |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) (let ((.cse10 (div (+ .cse7 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| .cse8 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2) (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (+ .cse12 .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|))) (= (+ (* (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse10) 2) .cse11) (+ .cse12 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 2) (* 2 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| .cse10)) .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2)))))) (< .cse1 .cse3))))) is different from false [2022-07-21 03:03:47,490 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17| Int) (|aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141| Int) (|aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| Int)) (let ((.cse0 (* 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse11 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2))) (let ((.cse2 (+ .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse5 (+ (* (- 1) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (* (- 1) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) .cse0)) (.cse6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse9 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse4 (+ (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse7 (* (- 1) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|)) (.cse8 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (.cse1 (+ (* |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| 2) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse3 (+ 2 .cse0))) (and (<= .cse0 .cse1) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (< |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| 2) (< .cse2 .cse3) (<= .cse0 .cse4) (<= .cse0 .cse2) (= (mod (+ |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (- 2) .cse5)) 2) 0) (not (= |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 0)) (<= (+ (div (+ .cse6 .cse7 .cse8 .cse9 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) (+ .cse0 1)) (= (mod (+ |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse5) .cse7) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) 0) (< .cse0 (+ (div (+ .cse6 |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| .cse7 .cse8 .cse9) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (< .cse4 .cse3) (not (let ((.cse12 (* (- 2) |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) (let ((.cse10 (div (+ .cse7 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| .cse8 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2) (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (+ .cse12 .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|))) (= (+ (* (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse10) 2) .cse11) (+ .cse12 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 2) (* 2 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| .cse10)) .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2)))))) (< .cse1 .cse3))))) is different from true [2022-07-21 03:03:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2022-07-21 03:03:47,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:03:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-21 03:03:47,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:03:47,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162050466] [2022-07-21 03:03:47,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:03:47,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182360728] [2022-07-21 03:03:47,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182360728] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:03:47,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:03:47,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2022-07-21 03:03:47,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985836457] [2022-07-21 03:03:47,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:03:47,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 03:03:47,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:03:47,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 03:03:47,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=198, Unknown=5, NotChecked=124, Total=380 [2022-07-21 03:03:47,631 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 20 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 03:03:49,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~X~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~X~0#1|)) (.cse8 (* |c_ULTIMATE.start_main_~Y~0#1| 2))) (and (let ((.cse5 (= |c_ULTIMATE.start_main_~Y~0#1| 0)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~y~0#1| (- 2) |c_ULTIMATE.start_main_~X~0#1|)) 2) 0)) (.cse3 (+ (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|) .cse7 (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) (- 2))))) (or (and (let ((.cse2 (= |c_ULTIMATE.start_main_~y~0#1| 0))) (or (let ((.cse0 (div |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse0)) (= (mod |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|) 0) (<= .cse0 .cse1) (not (<= .cse0 |c_ULTIMATE.start_main_~X~0#1|)) (not .cse2))) (and (= |c_ULTIMATE.start_main_~xy~0#1| 0) (= |c_ULTIMATE.start_main_~yx~0#1| 0) .cse2))) (= .cse3 0) .cse4 .cse5) (let ((.cse6 (div .cse3 |c_ULTIMATE.start_main_~Y~0#1|))) (and (<= .cse6 .cse1) (not .cse5) (= |c_ULTIMATE.start_main_~xy~0#1| (* |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse6)) (not (<= .cse6 |c_ULTIMATE.start_main_~X~0#1|)) .cse4 (= (mod .cse3 |c_ULTIMATE.start_main_~Y~0#1|) 0))))) (<= |c_ULTIMATE.start_main_~x~0#1| .cse1) (not (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~X~0#1|)) (= (+ |c_ULTIMATE.start_main_~X~0#1| (* 2 .cse7) |c_ULTIMATE.start_main_~v~0#1|) (+ .cse8 (* 2 (* |c_ULTIMATE.start_main_~Y~0#1| |c_ULTIMATE.start_main_~x~0#1|)))) (= (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~xy~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~yx~0#1| 2) .cse8)))) is different from false [2022-07-21 03:03:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:03:52,016 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-21 03:03:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 03:03:52,016 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-07-21 03:03:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:03:52,017 INFO L225 Difference]: With dead ends: 45 [2022-07-21 03:03:52,017 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 03:03:52,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=116, Invalid=450, Unknown=6, NotChecked=240, Total=812 [2022-07-21 03:03:52,018 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:03:52,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2022-07-21 03:03:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 03:03:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 03:03:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-21 03:03:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 03:03:52,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-07-21 03:03:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:03:52,019 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 03:03:52,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 03:03:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 03:03:52,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 03:03:52,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 03:03:52,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 03:03:52,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:03:52,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 03:03:55,034 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse3 (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse1 (* 2 |ULTIMATE.start_main_~Y~0#1|))) (let ((.cse0 (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) .cse1))) (.cse2 (= .cse3 |ULTIMATE.start_main_~yx~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (= .cse1 (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|)) (= |ULTIMATE.start_main_~x~0#1| 0) .cse2) (and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* .cse3 2) .cse1)) .cse0 (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)) .cse2)))) [2022-07-21 03:03:55,034 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 03:03:55,034 INFO L899 garLoopResultBuilder]: For program point L33-1(lines 30 45) no Hoare annotation was computed. [2022-07-21 03:03:55,034 INFO L902 garLoopResultBuilder]: At program point L50(lines 21 51) the Hoare annotation is: true [2022-07-21 03:03:55,034 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse2 (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2)) (.cse1 (* 2 |ULTIMATE.start_main_~Y~0#1|))) (and (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ .cse0 (* 2 |ULTIMATE.start_main_~yx~0#1|) .cse1)) (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ .cse2 .cse1)) (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ .cse0 .cse2 .cse1)))) [2022-07-21 03:03:55,034 INFO L899 garLoopResultBuilder]: For program point L48-1(line 48) no Hoare annotation was computed. [2022-07-21 03:03:55,034 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 43) no Hoare annotation was computed. [2022-07-21 03:03:55,034 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 43) no Hoare annotation was computed. [2022-07-21 03:03:55,034 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 03:03:55,034 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 03:03:55,034 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 03:03:55,035 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 45) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~Y~0#1|))) (or (and (= |ULTIMATE.start_main_~y~0#1| 0) (= .cse0 (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|)) (= |ULTIMATE.start_main_~x~0#1| 0)) (and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) .cse0)) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1))))) [2022-07-21 03:03:55,035 INFO L899 garLoopResultBuilder]: For program point L30-3(lines 30 45) no Hoare annotation was computed. [2022-07-21 03:03:55,035 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 16) no Hoare annotation was computed. [2022-07-21 03:03:55,035 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2022-07-21 03:03:55,035 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 17) no Hoare annotation was computed. [2022-07-21 03:03:55,035 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 13 19) no Hoare annotation was computed. [2022-07-21 03:03:55,035 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 13 19) no Hoare annotation was computed. [2022-07-21 03:03:55,035 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-07-21 03:03:55,037 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-07-21 03:03:55,038 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 03:03:55,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 03:03:55 BoogieIcfgContainer [2022-07-21 03:03:55,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 03:03:55,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 03:03:55,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 03:03:55,050 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 03:03:55,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:59:43" (3/4) ... [2022-07-21 03:03:55,054 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 03:03:55,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-21 03:03:55,060 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-21 03:03:55,060 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-21 03:03:55,060 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 03:03:55,060 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 03:03:55,080 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 03:03:55,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 03:03:55,080 INFO L158 Benchmark]: Toolchain (without parser) took 252537.51ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 37.6MB in the beginning and 64.2MB in the end (delta: -26.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-07-21 03:03:55,080 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:03:55,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.20ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 37.4MB in the beginning and 59.9MB in the end (delta: -22.5MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2022-07-21 03:03:55,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.28ms. Allocated memory is still 75.5MB. Free memory was 59.7MB in the beginning and 58.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 03:03:55,081 INFO L158 Benchmark]: Boogie Preprocessor took 27.99ms. Allocated memory is still 75.5MB. Free memory was 58.4MB in the beginning and 57.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:03:55,081 INFO L158 Benchmark]: RCFGBuilder took 248.16ms. Allocated memory is still 75.5MB. Free memory was 57.2MB in the beginning and 47.7MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 03:03:55,082 INFO L158 Benchmark]: TraceAbstraction took 252039.17ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 66.3MB in the end (delta: -19.0MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2022-07-21 03:03:55,082 INFO L158 Benchmark]: Witness Printer took 29.66ms. Allocated memory is still 92.3MB. Free memory was 66.3MB in the beginning and 64.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 03:03:55,083 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.20ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 37.4MB in the beginning and 59.9MB in the end (delta: -22.5MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.28ms. Allocated memory is still 75.5MB. Free memory was 59.7MB in the beginning and 58.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.99ms. Allocated memory is still 75.5MB. Free memory was 58.4MB in the beginning and 57.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 248.16ms. Allocated memory is still 75.5MB. Free memory was 57.2MB in the beginning and 47.7MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 252039.17ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 66.3MB in the end (delta: -19.0MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * Witness Printer took 29.66ms. Allocated memory is still 92.3MB. Free memory was 66.3MB in the beginning and 64.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 252.0s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 380 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 149 IncrementalHoareTripleChecker+Unchecked, 299 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1155 IncrementalHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 81 mSDtfsCounter, 1155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 406 GetRequests, 274 SyntacticMatches, 7 SemanticMatches, 125 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=6, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 43 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 20 PreInvPairs, 40 NumberOfFragments, 175 HoareAnnotationTreeSize, 20 FomulaSimplifications, 552 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3128 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 226.5s InterpolantComputationTime, 192 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 364 ConstructedInterpolants, 6 QuantifiedInterpolants, 3199 SizeOfPredicates, 38 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 284/370 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((y == 0 && 2 * Y == X + v) && x == 0) || (X * y * 2 + X + v == Y * x * 2 + 2 * Y && x <= X + 1) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-21 03:03:55,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE