./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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-scaling/ps6-ll_valuebound5.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 9671c34313c5e47de5bd2f842db47c3009aa180bae8c949f2010db1179ac602f --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 19:32:27,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 19:32:27,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 19:32:27,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 19:32:27,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 19:32:27,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 19:32:27,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 19:32:27,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 19:32:27,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 19:32:27,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 19:32:27,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 19:32:27,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 19:32:27,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 19:32:27,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 19:32:27,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 19:32:27,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 19:32:27,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 19:32:27,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 19:32:27,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 19:32:27,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 19:32:27,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 19:32:27,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 19:32:27,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 19:32:27,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 19:32:27,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 19:32:27,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 19:32:27,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 19:32:27,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 19:32:27,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 19:32:27,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 19:32:27,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 19:32:27,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 19:32:27,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 19:32:27,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 19:32:27,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 19:32:27,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 19:32:27,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 19:32:27,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 19:32:27,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 19:32:27,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 19:32:27,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 19:32:27,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 19:32:27,348 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 19:32:27,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 19:32:27,349 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 19:32:27,349 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 19:32:27,350 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 19:32:27,350 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 19:32:27,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 19:32:27,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 19:32:27,351 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 19:32:27,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 19:32:27,352 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 19:32:27,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 19:32:27,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 19:32:27,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 19:32:27,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 19:32:27,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 19:32:27,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 19:32:27,353 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 19:32:27,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 19:32:27,353 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 19:32:27,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 19:32:27,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 19:32:27,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 19:32:27,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 19:32:27,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:32:27,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 19:32:27,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 19:32:27,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 19:32:27,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 19:32:27,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 19:32:27,355 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 19:32:27,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 19:32:27,355 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 19:32:27,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 19:32:27,355 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 19:32:27,356 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9671c34313c5e47de5bd2f842db47c3009aa180bae8c949f2010db1179ac602f [2023-02-18 19:32:27,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 19:32:27,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 19:32:27,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 19:32:27,541 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 19:32:27,541 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 19:32:27,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c [2023-02-18 19:32:28,571 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 19:32:28,740 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 19:32:28,741 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c [2023-02-18 19:32:28,744 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596e116fa/541bdbfb00684b9f9870b836d1d544f0/FLAG36bd11bbb [2023-02-18 19:32:29,124 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596e116fa/541bdbfb00684b9f9870b836d1d544f0 [2023-02-18 19:32:29,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 19:32:29,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 19:32:29,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 19:32:29,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 19:32:29,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 19:32:29,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4387fef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29, skipping insertion in model container [2023-02-18 19:32:29,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 19:32:29,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 19:32:29,221 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c[458,471] [2023-02-18 19:32:29,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:32:29,235 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 19:32:29,242 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c[458,471] [2023-02-18 19:32:29,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:32:29,257 INFO L208 MainTranslator]: Completed translation [2023-02-18 19:32:29,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29 WrapperNode [2023-02-18 19:32:29,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 19:32:29,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 19:32:29,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 19:32:29,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 19:32:29,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,275 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-02-18 19:32:29,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 19:32:29,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 19:32:29,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 19:32:29,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 19:32:29,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 19:32:29,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 19:32:29,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 19:32:29,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 19:32:29,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (1/1) ... [2023-02-18 19:32:29,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:32:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:32:29,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 19:32:29,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 19:32:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 19:32:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 19:32:29,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 19:32:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 19:32:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 19:32:29,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 19:32:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 19:32:29,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 19:32:29,417 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 19:32:29,418 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 19:32:29,544 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 19:32:29,564 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 19:32:29,565 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 19:32:29,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:32:29 BoogieIcfgContainer [2023-02-18 19:32:29,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 19:32:29,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 19:32:29,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 19:32:29,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 19:32:29,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:32:29" (1/3) ... [2023-02-18 19:32:29,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e491307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:32:29, skipping insertion in model container [2023-02-18 19:32:29,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:32:29" (2/3) ... [2023-02-18 19:32:29,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e491307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:32:29, skipping insertion in model container [2023-02-18 19:32:29,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:32:29" (3/3) ... [2023-02-18 19:32:29,572 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound5.c [2023-02-18 19:32:29,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 19:32:29,595 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 19:32:29,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 19:32:29,659 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54eb6849, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 19:32:29,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 19:32:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 19:32:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 19:32:29,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:32:29,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:32:29,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:32:29,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:32:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2023-02-18 19:32:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:32:29,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84930095] [2023-02-18 19:32:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:32:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:32:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:32:29,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:32:29,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84930095] [2023-02-18 19:32:29,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 19:32:29,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020725240] [2023-02-18 19:32:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:32:29,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:32:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:32:29,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:32:29,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 19:32:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:32:29,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 19:32:29,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:32:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 19:32:29,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:32:29,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020725240] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:32:29,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:32:29,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 19:32:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852480432] [2023-02-18 19:32:29,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:32:29,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 19:32:29,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:32:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 19:32:29,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 19:32:29,950 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 19:32:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:32:29,969 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-02-18 19:32:29,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 19:32:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-18 19:32:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:32:29,978 INFO L225 Difference]: With dead ends: 45 [2023-02-18 19:32:29,979 INFO L226 Difference]: Without dead ends: 20 [2023-02-18 19:32:29,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 19:32:29,985 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 19:32:29,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 19:32:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-18 19:32:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-18 19:32:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 19:32:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-18 19:32:30,016 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2023-02-18 19:32:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:32:30,017 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-18 19:32:30,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 19:32:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-18 19:32:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 19:32:30,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:32:30,019 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:32:30,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 19:32:30,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-18 19:32:30,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:32:30,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:32:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2023-02-18 19:32:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:32:30,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58050250] [2023-02-18 19:32:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:32:30,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:32:30,253 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:32:30,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142227920] [2023-02-18 19:32:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:32:30,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:32:30,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:32:30,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:32:30,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 19:32:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:32:30,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 19:32:30,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:32:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 19:32:30,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:32:30,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:32:30,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58050250] [2023-02-18 19:32:30,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:32:30,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142227920] [2023-02-18 19:32:30,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142227920] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:32:30,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:32:30,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 19:32:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133568868] [2023-02-18 19:32:30,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:32:30,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 19:32:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:32:30,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 19:32:30,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 19:32:30,402 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 19:32:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:32:30,507 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-18 19:32:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 19:32:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-02-18 19:32:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:32:30,508 INFO L225 Difference]: With dead ends: 31 [2023-02-18 19:32:30,508 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 19:32:30,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 19:32:30,509 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:32:30,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:32:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 19:32:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-18 19:32:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 19:32:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-18 19:32:30,515 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2023-02-18 19:32:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:32:30,515 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-18 19:32:30,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 19:32:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-18 19:32:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 19:32:30,516 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:32:30,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:32:30,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 19:32:30,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-18 19:32:30,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:32:30,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:32:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2023-02-18 19:32:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:32:30,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137093217] [2023-02-18 19:32:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:32:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:32:30,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:32:30,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349275841] [2023-02-18 19:32:30,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:32:30,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:32:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:32:30,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:32:30,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 19:32:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:32:30,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 19:32:30,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:32:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 19:32:30,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:32:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 19:32:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:32:31,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137093217] [2023-02-18 19:32:31,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:32:31,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349275841] [2023-02-18 19:32:31,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349275841] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:32:31,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:32:31,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-18 19:32:31,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934023070] [2023-02-18 19:32:31,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:32:31,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 19:32:31,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:32:31,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 19:32:31,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 19:32:31,267 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 19:32:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:32:31,340 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-18 19:32:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 19:32:31,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-18 19:32:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:32:31,342 INFO L225 Difference]: With dead ends: 38 [2023-02-18 19:32:31,342 INFO L226 Difference]: Without dead ends: 34 [2023-02-18 19:32:31,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-18 19:32:31,343 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:32:31,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 89 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:32:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-18 19:32:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-02-18 19:32:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 19:32:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-18 19:32:31,350 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2023-02-18 19:32:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:32:31,350 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-18 19:32:31,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 19:32:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-18 19:32:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 19:32:31,351 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:32:31,352 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:32:31,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 19:32:31,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:32:31,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:32:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:32:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2023-02-18 19:32:31,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:32:31,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025309451] [2023-02-18 19:32:31,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:32:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:32:31,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:32:31,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443278595] [2023-02-18 19:32:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:32:31,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:32:31,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:32:31,589 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:32:31,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 19:32:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:32:31,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 19:32:31,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:32:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 19:32:31,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:32:33,734 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (* |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|) .cse0) (not (= (mod (+ .cse0 (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)))) is different from false [2023-02-18 19:32:37,786 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) .cse0) (= (mod (+ (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) .cse0) 12) 0))))) is different from true [2023-02-18 19:32:43,835 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) .cse0) (= (mod (+ (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) .cse0) 12) 0))))) is different from true [2023-02-18 19:32:53,920 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0))) is different from false [2023-02-18 19:32:53,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:32:53,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025309451] [2023-02-18 19:32:53,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:32:53,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443278595] [2023-02-18 19:32:53,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443278595] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:32:53,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:32:53,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-18 19:32:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416411514] [2023-02-18 19:32:53,928 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:32:53,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 19:32:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:32:53,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 19:32:53,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=105, Unknown=6, NotChecked=92, Total=240 [2023-02-18 19:32:53,929 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 19:32:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:32:54,010 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-02-18 19:32:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 19:32:54,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2023-02-18 19:32:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:32:54,011 INFO L225 Difference]: With dead ends: 38 [2023-02-18 19:32:54,011 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 19:32:54,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=56, Invalid=164, Unknown=6, NotChecked=116, Total=342 [2023-02-18 19:32:54,012 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:32:54,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 105 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:32:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 19:32:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-18 19:32:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 19:32:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-18 19:32:54,018 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-18 19:32:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:32:54,019 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-18 19:32:54,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 19:32:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-18 19:32:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 19:32:54,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:32:54,020 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:32:54,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 19:32:54,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:32:54,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:32:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:32:54,221 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2023-02-18 19:32:54,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:32:54,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547711692] [2023-02-18 19:32:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:32:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:32:54,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:32:54,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [39385475] [2023-02-18 19:32:54,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:32:54,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:32:54,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:32:54,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:32:54,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 19:32:54,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:32:54,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:32:54,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 19:32:54,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:32:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 19:32:54,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:32:56,419 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |c_ULTIMATE.start_main_~k~0#1|) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)) (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (= (* |c_ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|))) is different from false [2023-02-18 19:33:00,454 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| Int)) (or (let ((.cse0 (+ 1 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|))) (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| .cse0) (* .cse0 .cse0))) (= (mod (+ (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|)) 12) 0)))) is different from true [2023-02-18 19:33:06,476 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| Int)) (or (let ((.cse0 (+ 1 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|))) (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| .cse0) (* .cse0 .cse0))) (= (mod (+ (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|)) 12) 0)))) is different from true [2023-02-18 19:33:10,612 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~c~0#1|))) (or (not (< .cse0 |ULTIMATE.start_main_~k~0#1|)) (let ((.cse1 (+ 1 (+ 1 |c_ULTIMATE.start_main_~y~0#1|)))) (= (* |ULTIMATE.start_main_~k~0#1| .cse1) (* .cse1 .cse1))) (< (+ .cse0 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-18 19:33:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:33:10,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547711692] [2023-02-18 19:33:10,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:33:10,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39385475] [2023-02-18 19:33:10,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39385475] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:33:10,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:33:10,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 19:33:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511318019] [2023-02-18 19:33:10,619 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:33:10,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 19:33:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:33:10,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 19:33:10,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=150, Unknown=4, NotChecked=108, Total=306 [2023-02-18 19:33:10,620 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 19:33:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:33:10,743 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-02-18 19:33:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 19:33:10,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2023-02-18 19:33:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:33:10,745 INFO L225 Difference]: With dead ends: 41 [2023-02-18 19:33:10,745 INFO L226 Difference]: Without dead ends: 35 [2023-02-18 19:33:10,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=63, Invalid=221, Unknown=4, NotChecked=132, Total=420 [2023-02-18 19:33:10,746 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:33:10,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 125 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:33:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-18 19:33:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-18 19:33:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 19:33:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-18 19:33:10,753 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2023-02-18 19:33:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:33:10,753 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-18 19:33:10,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 19:33:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-18 19:33:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 19:33:10,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:33:10,754 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:33:10,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 19:33:10,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:33:10,963 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:33:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:33:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash 173594938, now seen corresponding path program 3 times [2023-02-18 19:33:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:33:10,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369748228] [2023-02-18 19:33:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:33:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:33:10,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:33:10,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771992548] [2023-02-18 19:33:10,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 19:33:10,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:33:10,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:33:10,973 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:33:10,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 19:33:11,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 19:33:11,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:33:11,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 19:33:11,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:33:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-18 19:33:12,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:33:14,858 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0))) is different from false [2023-02-18 19:33:14,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:33:14,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369748228] [2023-02-18 19:33:14,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:33:14,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771992548] [2023-02-18 19:33:14,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771992548] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:33:14,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:33:14,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 19:33:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565551840] [2023-02-18 19:33:14,861 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:33:14,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 19:33:14,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:33:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 19:33:14,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2023-02-18 19:33:14,862 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-18 19:33:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:33:14,995 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-02-18 19:33:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 19:33:14,996 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 50 [2023-02-18 19:33:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:33:14,997 INFO L225 Difference]: With dead ends: 44 [2023-02-18 19:33:14,997 INFO L226 Difference]: Without dead ends: 38 [2023-02-18 19:33:14,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2023-02-18 19:33:15,000 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:33:15,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:33:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-18 19:33:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-18 19:33:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 19:33:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-18 19:33:15,011 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2023-02-18 19:33:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:33:15,014 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-18 19:33:15,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-18 19:33:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-18 19:33:15,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 19:33:15,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:33:15,019 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:33:15,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 19:33:15,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:33:15,220 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:33:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:33:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1013596503, now seen corresponding path program 4 times [2023-02-18 19:33:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:33:15,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144297444] [2023-02-18 19:33:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:33:15,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:33:15,227 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:33:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112309709] [2023-02-18 19:33:15,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 19:33:15,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:33:15,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:33:15,229 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:33:15,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 19:33:15,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 19:33:15,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:33:15,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 19:33:15,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:33:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-18 19:33:15,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:33:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-18 19:33:15,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:33:15,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144297444] [2023-02-18 19:33:15,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:33:15,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112309709] [2023-02-18 19:33:15,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112309709] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:33:15,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:33:15,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-02-18 19:33:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614207732] [2023-02-18 19:33:15,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:33:15,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 19:33:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:33:15,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 19:33:15,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-02-18 19:33:15,446 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-18 19:33:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:33:15,872 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2023-02-18 19:33:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 19:33:15,873 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 57 [2023-02-18 19:33:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:33:15,873 INFO L225 Difference]: With dead ends: 63 [2023-02-18 19:33:15,873 INFO L226 Difference]: Without dead ends: 55 [2023-02-18 19:33:15,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2023-02-18 19:33:15,875 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 19:33:15,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 258 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 19:33:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-18 19:33:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-02-18 19:33:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-18 19:33:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-02-18 19:33:15,886 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 57 [2023-02-18 19:33:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:33:15,886 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-02-18 19:33:15,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-18 19:33:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-02-18 19:33:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-18 19:33:15,888 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:33:15,888 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:33:15,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 19:33:16,092 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 [2023-02-18 19:33:16,095 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:33:16,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:33:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1063034534, now seen corresponding path program 5 times [2023-02-18 19:33:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:33:16,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934545855] [2023-02-18 19:33:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:33:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:33:16,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:33:16,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574497874] [2023-02-18 19:33:16,112 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 19:33:16,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:33:16,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:33:16,113 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:33:16,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 19:33:17,045 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-18 19:33:17,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:33:17,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 19:33:17,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:33:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 225 proven. 3 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 19:33:17,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:33:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 157 proven. 3 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2023-02-18 19:33:17,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:33:17,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934545855] [2023-02-18 19:33:17,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:33:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574497874] [2023-02-18 19:33:17,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574497874] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:33:17,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:33:17,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-02-18 19:33:17,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105892702] [2023-02-18 19:33:17,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:33:17,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 19:33:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:33:17,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 19:33:17,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2023-02-18 19:33:17,241 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 23 states have internal predecessors, (58), 22 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2023-02-18 19:33:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:33:17,322 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2023-02-18 19:33:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 19:33:17,323 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 23 states have internal predecessors, (58), 22 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) Word has length 92 [2023-02-18 19:33:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:33:17,323 INFO L225 Difference]: With dead ends: 59 [2023-02-18 19:33:17,323 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 19:33:17,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-02-18 19:33:17,325 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:33:17,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 169 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:33:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 19:33:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 19:33:17,326 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) [2023-02-18 19:33:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 19:33:17,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2023-02-18 19:33:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:33:17,326 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 19:33:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 23 states have internal predecessors, (58), 22 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2023-02-18 19:33:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 19:33:17,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 19:33:17,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 19:33:17,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 19:33:17,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-18 19:33:17,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 19:33:17,544 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 19:33:17,544 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse23 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse22 (+ 1 .cse23)) (.cse21 (+ 1 |ULTIMATE.start_main_~c~0#1|))) (let ((.cse18 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse17 (+ 1 0)) (.cse19 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse3 (+ 1 .cse21)) (.cse1 (+ 1 .cse22)) (.cse20 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (let ((.cse6 (or (= (* |ULTIMATE.start_main_~k~0#1| .cse23) (* .cse23 .cse23)) (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not .cse20))) (.cse7 (or (not (< .cse21 |ULTIMATE.start_main_~k~0#1|)) (= (* |ULTIMATE.start_main_~k~0#1| .cse22) (* .cse22 .cse22)) (< (+ .cse21 1) |ULTIMATE.start_main_~k~0#1|))) (.cse11 (or (not (< .cse3 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse3 1) |ULTIMATE.start_main_~k~0#1|) (= (* |ULTIMATE.start_main_~k~0#1| .cse1) (* .cse1 .cse1)))) (.cse8 (+ |ULTIMATE.start_main_~c~0#1| (- 1))) (.cse5 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse9 (or (= 0 (+ (+ (+ (+ (* (* (* (* (* (* (- 2) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse19) (* 12 |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| .cse17) (= |ULTIMATE.start_main_~x~0#1| (+ (* (* (* .cse19 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) 0))))) (.cse10 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse13 (+ 1 1)) (.cse14 (+ 1 .cse17)) (.cse16 (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse19) .cse20)) (.cse15 (+ .cse18 (- 1)))) (or (let ((.cse4 (+ 1 3))) (and (let ((.cse2 (+ 1 .cse3))) (or (let ((.cse0 (+ 1 .cse1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< .cse2 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse2 1) |ULTIMATE.start_main_~k~0#1|))) (= |ULTIMATE.start_main_~y~0#1| .cse4) .cse5 .cse6 .cse7 (<= 3 .cse8) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_main_~c~0#1| .cse4) (< 3 |ULTIMATE.start_main_~k~0#1|))) (let ((.cse12 (+ 1 .cse13))) (and (<= 2 .cse8) (<= |ULTIMATE.start_main_~c~0#1| .cse12) (= |ULTIMATE.start_main_~y~0#1| .cse12) .cse5 .cse9 .cse10 (< .cse13 |ULTIMATE.start_main_~k~0#1|) (= .cse8 .cse14) (= (+ .cse15 (- 1)) 0) .cse16)) (and .cse5 (= |ULTIMATE.start_main_~c~0#1| .cse17) (<= 0 .cse8) .cse9 .cse10 (<= |ULTIMATE.start_main_~c~0#1| .cse17) (= .cse18 0) (= .cse8 0) .cse16 (< 0 |ULTIMATE.start_main_~k~0#1|) (< .cse8 |ULTIMATE.start_main_~k~0#1|)) (and .cse5 (= |ULTIMATE.start_main_~x~0#1| 0) .cse10 (>= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (and .cse6 .cse5 .cse7 (<= 4 .cse8) .cse9 .cse10 .cse11 .cse16) (and (<= 1 .cse8) (= |ULTIMATE.start_main_~y~0#1| .cse13) (<= |ULTIMATE.start_main_~c~0#1| .cse13) .cse5 .cse9 .cse10 (= |ULTIMATE.start_main_~c~0#1| .cse13) (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse14) .cse16 (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|) (= .cse15 0))))))) [2023-02-18 19:33:17,545 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-02-18 19:33:17,545 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-02-18 19:33:17,545 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~k~0#1| 0) (<= |ULTIMATE.start_main_~k~0#1| 5)) [2023-02-18 19:33:17,545 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 19:33:17,545 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 42) the Hoare annotation is: true [2023-02-18 19:33:17,545 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-02-18 19:33:17,545 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 19:33:17,545 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 19:33:17,546 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse23 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse22 (+ 1 .cse23)) (.cse21 (+ 1 |ULTIMATE.start_main_~c~0#1|))) (let ((.cse18 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse17 (+ 1 0)) (.cse19 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse3 (+ 1 .cse21)) (.cse1 (+ 1 .cse22)) (.cse20 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (let ((.cse6 (or (= (* |ULTIMATE.start_main_~k~0#1| .cse23) (* .cse23 .cse23)) (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not .cse20))) (.cse7 (or (not (< .cse21 |ULTIMATE.start_main_~k~0#1|)) (= (* |ULTIMATE.start_main_~k~0#1| .cse22) (* .cse22 .cse22)) (< (+ .cse21 1) |ULTIMATE.start_main_~k~0#1|))) (.cse11 (or (not (< .cse3 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse3 1) |ULTIMATE.start_main_~k~0#1|) (= (* |ULTIMATE.start_main_~k~0#1| .cse1) (* .cse1 .cse1)))) (.cse8 (+ |ULTIMATE.start_main_~c~0#1| (- 1))) (.cse5 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse9 (or (= 0 (+ (+ (+ (+ (* (* (* (* (* (* (- 2) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse19) (* 12 |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| .cse17) (= |ULTIMATE.start_main_~x~0#1| (+ (* (* (* .cse19 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) 0))))) (.cse10 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse13 (+ 1 1)) (.cse14 (+ 1 .cse17)) (.cse16 (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse19) .cse20)) (.cse15 (+ .cse18 (- 1)))) (or (let ((.cse4 (+ 1 3))) (and (let ((.cse2 (+ 1 .cse3))) (or (let ((.cse0 (+ 1 .cse1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< .cse2 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse2 1) |ULTIMATE.start_main_~k~0#1|))) (= |ULTIMATE.start_main_~y~0#1| .cse4) .cse5 .cse6 .cse7 (<= 3 .cse8) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_main_~c~0#1| .cse4) (< 3 |ULTIMATE.start_main_~k~0#1|))) (let ((.cse12 (+ 1 .cse13))) (and (<= 2 .cse8) (<= |ULTIMATE.start_main_~c~0#1| .cse12) (= |ULTIMATE.start_main_~y~0#1| .cse12) .cse5 .cse9 .cse10 (< .cse13 |ULTIMATE.start_main_~k~0#1|) (= .cse8 .cse14) (= (+ .cse15 (- 1)) 0) .cse16)) (and .cse5 (= |ULTIMATE.start_main_~c~0#1| .cse17) (<= 0 .cse8) .cse9 .cse10 (<= |ULTIMATE.start_main_~c~0#1| .cse17) (= .cse18 0) (= .cse8 0) .cse16 (< 0 |ULTIMATE.start_main_~k~0#1|) (< .cse8 |ULTIMATE.start_main_~k~0#1|)) (and .cse5 (= |ULTIMATE.start_main_~x~0#1| 0) .cse10 (>= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (and .cse6 .cse5 .cse7 (<= 4 .cse8) .cse9 .cse10 .cse11 .cse16) (and (<= 1 .cse8) (= |ULTIMATE.start_main_~y~0#1| .cse13) (<= |ULTIMATE.start_main_~c~0#1| .cse13) .cse5 .cse9 .cse10 (= |ULTIMATE.start_main_~c~0#1| .cse13) (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse14) .cse16 (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|) (= .cse15 0))))))) [2023-02-18 19:33:17,546 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse16 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse14 (+ 1 |ULTIMATE.start_main_~c~0#1|)) (.cse15 (+ 1 .cse16))) (let ((.cse11 (+ 1 0)) (.cse8 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse13 (+ 1 .cse15)) (.cse12 (+ 1 .cse14))) (let ((.cse0 (let ((.cse18 (+ 1 .cse12))) (or (let ((.cse17 (+ 1 .cse13))) (= (* |ULTIMATE.start_main_~k~0#1| .cse17) (* .cse17 .cse17))) (not (< .cse18 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse18 1) |ULTIMATE.start_main_~k~0#1|)))) (.cse3 (or (= (* |ULTIMATE.start_main_~k~0#1| .cse16) (* .cse16 .cse16)) (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))) (.cse2 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse4 (or (not (< .cse14 |ULTIMATE.start_main_~k~0#1|)) (= (* |ULTIMATE.start_main_~k~0#1| .cse15) (* .cse15 .cse15)) (< (+ .cse14 1) |ULTIMATE.start_main_~k~0#1|))) (.cse6 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse7 (or (not (< .cse12 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse12 1) |ULTIMATE.start_main_~k~0#1|) (= (* |ULTIMATE.start_main_~k~0#1| .cse13) (* .cse13 .cse13)))) (.cse10 (+ 1 1)) (.cse5 (or (= 0 (+ (+ (+ (+ (* (* (* (* (* (* (- 2) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse8) (* 12 |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| .cse11) (= |ULTIMATE.start_main_~x~0#1| (+ (* (* (* .cse8 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) 0)))))) (or (let ((.cse1 (+ 1 3))) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~k~0#1| 4) .cse7 (<= |ULTIMATE.start_main_~c~0#1| .cse1) (< 3 |ULTIMATE.start_main_~k~0#1|))) (and .cse0 (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse8) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ 1 .cse10))) (and (<= |ULTIMATE.start_main_~c~0#1| .cse9) (= |ULTIMATE.start_main_~y~0#1| .cse9) .cse5 (<= |ULTIMATE.start_main_~k~0#1| 3) (< .cse10 |ULTIMATE.start_main_~k~0#1|))) (and .cse5 (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| .cse11) (= (+ |ULTIMATE.start_main_~y~0#1| (- 1)) 0) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| .cse10) (<= |ULTIMATE.start_main_~c~0#1| .cse10) .cse5 (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|))))))) [2023-02-18 19:33:17,546 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-02-18 19:33:17,547 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse16 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse14 (+ 1 |ULTIMATE.start_main_~c~0#1|)) (.cse15 (+ 1 .cse16))) (let ((.cse11 (+ 1 0)) (.cse8 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse13 (+ 1 .cse15)) (.cse12 (+ 1 .cse14))) (let ((.cse0 (let ((.cse18 (+ 1 .cse12))) (or (let ((.cse17 (+ 1 .cse13))) (= (* |ULTIMATE.start_main_~k~0#1| .cse17) (* .cse17 .cse17))) (not (< .cse18 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse18 1) |ULTIMATE.start_main_~k~0#1|)))) (.cse3 (or (= (* |ULTIMATE.start_main_~k~0#1| .cse16) (* .cse16 .cse16)) (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))) (.cse2 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse4 (or (not (< .cse14 |ULTIMATE.start_main_~k~0#1|)) (= (* |ULTIMATE.start_main_~k~0#1| .cse15) (* .cse15 .cse15)) (< (+ .cse14 1) |ULTIMATE.start_main_~k~0#1|))) (.cse6 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse7 (or (not (< .cse12 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse12 1) |ULTIMATE.start_main_~k~0#1|) (= (* |ULTIMATE.start_main_~k~0#1| .cse13) (* .cse13 .cse13)))) (.cse10 (+ 1 1)) (.cse5 (or (= 0 (+ (+ (+ (+ (* (* (* (* (* (* (- 2) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse8) (* 12 |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| .cse11) (= |ULTIMATE.start_main_~x~0#1| (+ (* (* (* .cse8 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) 0)))))) (or (let ((.cse1 (+ 1 3))) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~k~0#1| 4) .cse7 (<= |ULTIMATE.start_main_~c~0#1| .cse1) (< 3 |ULTIMATE.start_main_~k~0#1|))) (and .cse0 (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse8) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ 1 .cse10))) (and (<= |ULTIMATE.start_main_~c~0#1| .cse9) (= |ULTIMATE.start_main_~y~0#1| .cse9) .cse5 (<= |ULTIMATE.start_main_~k~0#1| 3) (< .cse10 |ULTIMATE.start_main_~k~0#1|))) (and .cse5 (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| .cse11) (= (+ |ULTIMATE.start_main_~y~0#1| (- 1)) 0) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| .cse10) (<= |ULTIMATE.start_main_~c~0#1| .cse10) .cse5 (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|))))))) [2023-02-18 19:33:17,547 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-02-18 19:33:17,547 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-18 19:33:17,547 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-02-18 19:33:17,547 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-02-18 19:33:17,547 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-18 19:33:17,547 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-18 19:33:17,547 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-18 19:33:17,547 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-18 19:33:17,548 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-18 19:33:17,548 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-18 19:33:17,550 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-02-18 19:33:17,552 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 19:33:17,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:33:17 BoogieIcfgContainer [2023-02-18 19:33:17,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 19:33:17,593 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 19:33:17,593 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 19:33:17,593 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 19:33:17,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:32:29" (3/4) ... [2023-02-18 19:33:17,596 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 19:33:17,600 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 19:33:17,616 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 19:33:17,619 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 19:33:17,619 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 19:33:17,619 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 19:33:17,619 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 19:33:17,658 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 19:33:17,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 19:33:17,658 INFO L158 Benchmark]: Toolchain (without parser) took 48532.05ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 118.1MB in the beginning and 94.3MB in the end (delta: 23.8MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2023-02-18 19:33:17,659 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:33:17,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 130.88ms. Allocated memory is still 148.9MB. Free memory was 117.8MB in the beginning and 107.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 19:33:17,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.03ms. Allocated memory is still 148.9MB. Free memory was 107.5MB in the beginning and 105.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:33:17,659 INFO L158 Benchmark]: Boogie Preprocessor took 10.68ms. Allocated memory is still 148.9MB. Free memory was 105.9MB in the beginning and 104.9MB in the end (delta: 970.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:33:17,659 INFO L158 Benchmark]: RCFGBuilder took 279.27ms. Allocated memory is still 148.9MB. Free memory was 104.9MB in the beginning and 94.7MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 19:33:17,660 INFO L158 Benchmark]: TraceAbstraction took 48025.11ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 94.1MB in the beginning and 97.4MB in the end (delta: -3.3MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2023-02-18 19:33:17,660 INFO L158 Benchmark]: Witness Printer took 64.90ms. Allocated memory is still 218.1MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 19:33:17,661 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.13ms. Allocated memory is still 115.3MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 130.88ms. Allocated memory is still 148.9MB. Free memory was 117.8MB in the beginning and 107.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.03ms. Allocated memory is still 148.9MB. Free memory was 107.5MB in the beginning and 105.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 10.68ms. Allocated memory is still 148.9MB. Free memory was 105.9MB in the beginning and 104.9MB in the end (delta: 970.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 279.27ms. Allocated memory is still 148.9MB. Free memory was 104.9MB in the beginning and 94.7MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 48025.11ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 94.1MB in the beginning and 97.4MB in the end (delta: -3.3MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * Witness Printer took 64.90ms. Allocated memory is still 218.1MB. Free memory was 96.4MB in the beginning and 94.3MB 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: 12]: 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 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.9s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 986 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 795 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1050 IncrementalHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 191 mSDtfsCounter, 1050 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 453 SyntacticMatches, 10 SemanticMatches, 127 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 26.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=7, InterpolantAutomatonStates: 81, 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, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 37 PreInvPairs, 63 NumberOfFragments, 3153 HoareAnnotationTreeSize, 37 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 43.4s InterpolantComputationTime, 357 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 2544 SizeOfPredicates, 29 NumberOfNonLiveVariables, 870 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 1022/1140 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: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((((((((((k * (1 + (1 + (1 + (1 + y)))) == (1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y)))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k) && y == 1 + 3) && k >= 0) && ((k * (1 + y) == (1 + y) * (1 + y) || c + 1 < k) || !(c < k))) && ((!(1 + c < k) || k * (1 + (1 + y)) == (1 + (1 + y)) * (1 + (1 + y))) || 1 + c + 1 < k)) && 3 <= c + -1) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && k <= 5) && ((!(1 + (1 + c) < k) || 1 + (1 + c) + 1 < k) || k * (1 + (1 + (1 + y))) == (1 + (1 + (1 + y))) * (1 + (1 + (1 + y))))) && c <= 1 + 3) && 3 < k) || (((((((((2 <= c + -1 && c <= 1 + (1 + 1)) && y == 1 + (1 + 1)) && k >= 0) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && k <= 5) && 1 + 1 < k) && c + -1 == 1 + (1 + 0)) && y + -1 + -1 + -1 == 0) && (k * y == y * y || c < k))) || ((((((((((k >= 0 && c == 1 + 0) && 0 <= c + -1) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && k <= 5) && c <= 1 + 0) && y + -1 == 0) && c + -1 == 0) && (k * y == y * y || c < k)) && 0 < k) && c + -1 < k)) || (((((k >= 0 && x == 0) && k <= 5) && c >= 0) && y == 0) && c == 0)) || (((((((((k * (1 + y) == (1 + y) * (1 + y) || c + 1 < k) || !(c < k)) && k >= 0) && ((!(1 + c < k) || k * (1 + (1 + y)) == (1 + (1 + y)) * (1 + (1 + y))) || 1 + c + 1 < k)) && 4 <= c + -1) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && k <= 5) && ((!(1 + (1 + c) < k) || 1 + (1 + c) + 1 < k) || k * (1 + (1 + (1 + y))) == (1 + (1 + (1 + y))) * (1 + (1 + (1 + y))))) && (k * y == y * y || c < k))) || (((((((((((1 <= c + -1 && y == 1 + 1) && c <= 1 + 1) && k >= 0) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && k <= 5) && c == 1 + 1) && 1 < k) && c == 1 + (1 + 0)) && (k * y == y * y || c < k)) && 1 + -1 < k) && y + -1 + -1 == 0) RESULT: Ultimate proved your program to be correct! [2023-02-18 19:33:17,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE