./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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_valuebound10.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 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 04:11:00,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 04:11:00,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 04:11:00,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 04:11:00,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 04:11:00,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 04:11:00,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 04:11:00,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 04:11:00,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 04:11:00,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 04:11:00,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 04:11:00,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 04:11:00,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 04:11:00,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 04:11:00,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 04:11:00,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 04:11:00,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 04:11:00,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 04:11:00,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 04:11:00,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 04:11:00,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 04:11:00,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 04:11:00,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 04:11:00,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 04:11:00,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 04:11:00,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 04:11:00,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 04:11:00,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 04:11:00,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 04:11:00,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 04:11:00,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 04:11:00,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 04:11:00,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 04:11:00,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 04:11:00,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 04:11:00,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 04:11:00,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 04:11:00,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 04:11:00,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 04:11:00,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 04:11:00,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 04:11:00,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 04:11:00,599 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 04:11:00,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 04:11:00,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 04:11:00,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 04:11:00,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 04:11:00,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 04:11:00,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 04:11:00,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 04:11:00,602 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 04:11:00,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 04:11:00,602 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 04:11:00,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 04:11:00,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 04:11:00,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 04:11:00,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 04:11:00,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 04:11:00,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 04:11:00,603 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 04:11:00,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 04:11:00,604 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 04:11:00,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 04:11:00,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 04:11:00,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 04:11:00,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 04:11:00,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:11:00,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 04:11:00,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 04:11:00,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 04:11:00,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 04:11:00,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 04:11:00,606 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 04:11:00,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 04:11:00,606 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 04:11:00,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 04:11:00,607 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 04:11:00,607 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 -> 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b [2023-02-18 04:11:00,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 04:11:00,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 04:11:00,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 04:11:00,783 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 04:11:00,783 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 04:11:00,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2023-02-18 04:11:01,766 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 04:11:01,886 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 04:11:01,886 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2023-02-18 04:11:01,892 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1fe268c/a76fdbefbfca4814bd94ba07ad559ab2/FLAG5082b76b1 [2023-02-18 04:11:01,907 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1fe268c/a76fdbefbfca4814bd94ba07ad559ab2 [2023-02-18 04:11:01,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 04:11:01,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 04:11:01,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 04:11:01,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 04:11:01,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 04:11:01,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:11:01" (1/1) ... [2023-02-18 04:11:01,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e557df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:01, skipping insertion in model container [2023-02-18 04:11:01,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:11:01" (1/1) ... [2023-02-18 04:11:01,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 04:11:01,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 04:11:02,043 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_valuebound10.c[458,471] [2023-02-18 04:11:02,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:11:02,065 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 04:11:02,076 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_valuebound10.c[458,471] [2023-02-18 04:11:02,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:11:02,102 INFO L208 MainTranslator]: Completed translation [2023-02-18 04:11:02,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02 WrapperNode [2023-02-18 04:11:02,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 04:11:02,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 04:11:02,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 04:11:02,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 04:11:02,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,126 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-02-18 04:11:02,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 04:11:02,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 04:11:02,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 04:11:02,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 04:11:02,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,150 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 04:11:02,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 04:11:02,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 04:11:02,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 04:11:02,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (1/1) ... [2023-02-18 04:11:02,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:11:02,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:11:02,181 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 04:11:02,199 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 04:11:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 04:11:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 04:11:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 04:11:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 04:11:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 04:11:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 04:11:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 04:11:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 04:11:02,253 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 04:11:02,255 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 04:11:02,373 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 04:11:02,392 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 04:11:02,392 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 04:11:02,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:11:02 BoogieIcfgContainer [2023-02-18 04:11:02,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 04:11:02,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 04:11:02,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 04:11:02,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 04:11:02,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:11:01" (1/3) ... [2023-02-18 04:11:02,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7960bf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:11:02, skipping insertion in model container [2023-02-18 04:11:02,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:02" (2/3) ... [2023-02-18 04:11:02,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7960bf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:11:02, skipping insertion in model container [2023-02-18 04:11:02,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:11:02" (3/3) ... [2023-02-18 04:11:02,400 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2023-02-18 04:11:02,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 04:11:02,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 04:11:02,437 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 04:11:02,441 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;@7375a0c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 04:11:02,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 04:11:02,470 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 04:11:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 04:11:02,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:11:02,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:11:02,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:11:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:11:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2023-02-18 04:11:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:11:02,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775616283] [2023-02-18 04:11:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:11:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:11:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:11:02,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775616283] [2023-02-18 04:11:02,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 04:11:02,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705132993] [2023-02-18 04:11:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:02,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:11:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:11:02,558 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 04:11:02,559 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 04:11:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:11:02,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 04:11:02,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:11:02,655 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 04:11:02,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:11:02,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705132993] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:11:02,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:11:02,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 04:11:02,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994894757] [2023-02-18 04:11:02,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:11:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 04:11:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:11:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 04:11:02,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 04:11:02,691 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 04:11:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:11:02,710 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-02-18 04:11:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 04:11:02,713 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 04:11:02,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:11:02,718 INFO L225 Difference]: With dead ends: 45 [2023-02-18 04:11:02,718 INFO L226 Difference]: Without dead ends: 20 [2023-02-18 04:11:02,721 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 04:11:02,725 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 04:11:02,726 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 04:11:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-18 04:11:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-18 04:11:02,752 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 04:11:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-18 04:11:02,755 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2023-02-18 04:11:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:11:02,755 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-18 04:11:02,756 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 04:11:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-18 04:11:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 04:11:02,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:11:02,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:11:02,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 04:11:02,962 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 04:11:02,962 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:11:02,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:11:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2023-02-18 04:11:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:11:02,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706860141] [2023-02-18 04:11:02,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:11:02,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:11:02,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864655359] [2023-02-18 04:11:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:11:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:11:02,984 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 04:11:02,996 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 04:11:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:11:03,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 04:11:03,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:11:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:11:03,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:11:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:11:03,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706860141] [2023-02-18 04:11:03,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:11:03,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864655359] [2023-02-18 04:11:03,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864655359] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:11:03,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:11:03,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 04:11:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559573664] [2023-02-18 04:11:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:11:03,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:11:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:11:03,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:11:03,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:11:03,072 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:11:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:11:03,196 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-18 04:11:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:11:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-02-18 04:11:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:11:03,197 INFO L225 Difference]: With dead ends: 31 [2023-02-18 04:11:03,197 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 04:11:03,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:11:03,199 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:11:03,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:11:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 04:11:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-18 04:11:03,208 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 04:11:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-18 04:11:03,210 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2023-02-18 04:11:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:11:03,211 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-18 04:11:03,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:11:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-18 04:11:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 04:11:03,212 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:11:03,213 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 04:11:03,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 04:11:03,424 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 04:11:03,424 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:11:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:11:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2023-02-18 04:11:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:11:03,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526120462] [2023-02-18 04:11:03,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:03,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:11:03,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:11:03,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222720036] [2023-02-18 04:11:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:03,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:11:03,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:11:03,456 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 04:11:03,462 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 04:11:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:11:03,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 04:11:03,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:11:03,604 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 04:11:03,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:11:03,934 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 04:11:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:11:03,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526120462] [2023-02-18 04:11:03,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:11:03,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222720036] [2023-02-18 04:11:03,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222720036] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:11:03,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:11:03,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-18 04:11:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627456785] [2023-02-18 04:11:03,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:11:03,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 04:11:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:11:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 04:11:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:11:03,939 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 04:11:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:11:04,011 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-18 04:11:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 04:11:04,012 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 04:11:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:11:04,013 INFO L225 Difference]: With dead ends: 38 [2023-02-18 04:11:04,013 INFO L226 Difference]: Without dead ends: 34 [2023-02-18 04:11:04,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-18 04:11:04,014 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 04:11:04,014 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 04:11:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-18 04:11:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-02-18 04:11:04,021 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 04:11:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-18 04:11:04,021 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2023-02-18 04:11:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:11:04,022 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-18 04:11:04,022 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 04:11:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-18 04:11:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 04:11:04,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:11:04,023 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 04:11:04,030 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 04:11:04,227 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 04:11:04,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:11:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:11:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2023-02-18 04:11:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:11:04,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825013352] [2023-02-18 04:11:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:04,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:11:04,245 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:11:04,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [372776166] [2023-02-18 04:11:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:04,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:11:04,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:11:04,248 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 04:11:04,267 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 04:11:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:11:04,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 04:11:04,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:11:06,389 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main_~k~0#1|) (= |c_ULTIMATE.start_main_~y~0#1| (+ 0 1)) (<= |c_ULTIMATE.start_main_~k~0#1| 1) (= 0 (mod (+ (* |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| 5) (* |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| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |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| 6)) 12))) is different from true [2023-02-18 04:11:06,407 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 04:11:06,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:11:08,432 WARN L837 $PredicateComparison]: unable to prove that (or (not (= 0 (mod (+ (* |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| 5) (* |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| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |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| 6)) 12))) (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) is different from false [2023-02-18 04:11:12,498 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)) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |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|)) (= (mod (+ (* 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|) (* 2 |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|) (* 11 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 5 |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|)) 12) 0)))) is different from true [2023-02-18 04:11:18,537 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (= c___VERIFIER_assert_~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)) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |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|)) (= (mod (+ (* 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|) (* 2 |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|) (* 11 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 5 |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|)) 12) 0)))) is different from true [2023-02-18 04:11:20,544 WARN L837 $PredicateComparison]: unable to prove that (or (not (= 0 (mod (+ (* |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| 5) (* |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| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |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| 6)) 12))) (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|)) is different from false [2023-02-18 04:11:22,566 WARN L837 $PredicateComparison]: unable to prove that (or (not (= 0 (mod (+ (* |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| 5) (* |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| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |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| 6)) 12))) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:11:22,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:11:22,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825013352] [2023-02-18 04:11:22,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:11:22,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372776166] [2023-02-18 04:11:22,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372776166] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:11:22,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:11:22,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 04:11:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760815335] [2023-02-18 04:11:22,574 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:11:22,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 04:11:22,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:11:22,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 04:11:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=93, Unknown=6, NotChecked=138, Total=272 [2023-02-18 04:11:22,576 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 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 04:11:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:11:22,664 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-02-18 04:11:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 04:11:22,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 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 04:11:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:11:22,665 INFO L225 Difference]: With dead ends: 38 [2023-02-18 04:11:22,666 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 04:11:22,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=53, Invalid=147, Unknown=6, NotChecked=174, Total=380 [2023-02-18 04:11:22,667 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:11:22,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 105 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2023-02-18 04:11:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 04:11:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-18 04:11:22,672 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 04:11:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-18 04:11:22,673 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-18 04:11:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:11:22,673 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-18 04:11:22,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 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 04:11:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-18 04:11:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 04:11:22,674 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:11:22,675 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 04:11:22,697 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 04:11:22,875 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 04:11:22,875 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:11:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:11:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2023-02-18 04:11:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:11:22,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546707141] [2023-02-18 04:11:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:11:22,884 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:11:22,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195081044] [2023-02-18 04:11:22,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:11:22,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:11:22,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:11:22,906 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 04:11:22,907 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 04:11:22,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:11:22,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:11:22,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 04:11:22,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:11:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-18 04:11:23,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:11:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-18 04:11:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:11:23,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546707141] [2023-02-18 04:11:23,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:11:23,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195081044] [2023-02-18 04:11:23,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195081044] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:11:23,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:11:23,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-18 04:11:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391657339] [2023-02-18 04:11:23,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:11:23,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 04:11:23,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:11:23,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 04:11:23,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-02-18 04:11:23,118 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 17 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-18 04:11:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:11:23,353 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-02-18 04:11:23,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 04:11:23,354 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) Word has length 43 [2023-02-18 04:11:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:11:23,355 INFO L225 Difference]: With dead ends: 51 [2023-02-18 04:11:23,355 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 04:11:23,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-02-18 04:11:23,356 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:11:23,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 175 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:11:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 04:11:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-02-18 04:11:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:11:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-02-18 04:11:23,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 43 [2023-02-18 04:11:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:11:23,375 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-02-18 04:11:23,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-18 04:11:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-02-18 04:11:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-18 04:11:23,376 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:11:23,376 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:11:23,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 04:11:23,580 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 04:11:23,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:11:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:11:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 66449050, now seen corresponding path program 3 times [2023-02-18 04:11:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:11:23,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574938903] [2023-02-18 04:11:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:11:23,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:11:23,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142586339] [2023-02-18 04:11:23,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:11:23,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:11:23,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:11:23,618 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 04:11:23,620 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 04:11:23,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-18 04:11:23,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:11:23,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-18 04:11:23,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:11:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 55 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-02-18 04:11:23,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:11:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:11:23,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574938903] [2023-02-18 04:11:23,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:11:23,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142586339] [2023-02-18 04:11:23,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142586339] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:11:23,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:11:23,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-18 04:11:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191099866] [2023-02-18 04:11:23,883 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:11:23,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 04:11:23,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:11:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 04:11:23,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-02-18 04:11:23,885 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-18 04:11:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:11:24,064 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-02-18 04:11:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 04:11:24,065 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 64 [2023-02-18 04:11:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:11:24,065 INFO L225 Difference]: With dead ends: 50 [2023-02-18 04:11:24,065 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 04:11:24,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-02-18 04:11:24,066 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:11:24,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 188 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:11:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 04:11:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-18 04:11:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:11:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-02-18 04:11:24,076 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 64 [2023-02-18 04:11:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:11:24,076 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-02-18 04:11:24,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-18 04:11:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-02-18 04:11:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-18 04:11:24,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:11:24,078 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:11:24,095 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 04:11:24,283 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 04:11:24,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:11:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:11:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 357326839, now seen corresponding path program 4 times [2023-02-18 04:11:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:11:24,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187458991] [2023-02-18 04:11:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:24,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:11:24,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:11:24,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046698965] [2023-02-18 04:11:24,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 04:11:24,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:11:24,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:11:24,294 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 04:11:24,296 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 04:11:24,346 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 04:11:24,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:11:24,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-18 04:11:24,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:11:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-02-18 04:11:24,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:11:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-02-18 04:11:24,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:11:24,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187458991] [2023-02-18 04:11:24,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:11:24,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046698965] [2023-02-18 04:11:24,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046698965] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:11:24,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:11:24,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2023-02-18 04:11:24,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707662008] [2023-02-18 04:11:24,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:11:24,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 04:11:24,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:11:24,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 04:11:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-02-18 04:11:24,603 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 18 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2023-02-18 04:11:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:11:25,301 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2023-02-18 04:11:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 04:11:25,302 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 18 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) Word has length 71 [2023-02-18 04:11:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:11:25,303 INFO L225 Difference]: With dead ends: 75 [2023-02-18 04:11:25,303 INFO L226 Difference]: Without dead ends: 67 [2023-02-18 04:11:25,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1387, Unknown=0, NotChecked=0, Total=1722 [2023-02-18 04:11:25,304 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 04:11:25,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 353 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 04:11:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-18 04:11:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-02-18 04:11:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-18 04:11:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2023-02-18 04:11:25,319 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 71 [2023-02-18 04:11:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:11:25,320 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2023-02-18 04:11:25,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 18 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2023-02-18 04:11:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2023-02-18 04:11:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-02-18 04:11:25,321 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:11:25,321 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 14, 14, 14, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:11:25,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 04:11:25,526 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 04:11:25,526 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:11:25,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:11:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2004694042, now seen corresponding path program 5 times [2023-02-18 04:11:25,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:11:25,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845520182] [2023-02-18 04:11:25,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:11:25,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:11:25,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:11:25,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891429084] [2023-02-18 04:11:25,536 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 04:11:25,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:11:25,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:11:25,537 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 04:11:25,573 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 04:11:26,342 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2023-02-18 04:11:26,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:11:26,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 04:11:26,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:11:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 403 proven. 3 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2023-02-18 04:11:26,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:11:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 303 proven. 3 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2023-02-18 04:11:26,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:11:26,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845520182] [2023-02-18 04:11:26,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:11:26,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891429084] [2023-02-18 04:11:26,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891429084] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:11:26,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:11:26,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2023-02-18 04:11:26,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622485305] [2023-02-18 04:11:26,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:11:26,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-18 04:11:26,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:11:26,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-18 04:11:26,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=694, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 04:11:26,648 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 33 states, 33 states have (on average 2.242424242424242) internal successors, (74), 31 states have internal predecessors, (74), 30 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 29 states have call predecessors, (34), 30 states have call successors, (34) [2023-02-18 04:11:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:11:26,753 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2023-02-18 04:11:26,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 04:11:26,756 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.242424242424242) internal successors, (74), 31 states have internal predecessors, (74), 30 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 29 states have call predecessors, (34), 30 states have call successors, (34) Word has length 120 [2023-02-18 04:11:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:11:26,757 INFO L225 Difference]: With dead ends: 71 [2023-02-18 04:11:26,757 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 04:11:26,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=755, Unknown=0, NotChecked=0, Total=1122 [2023-02-18 04:11:26,758 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:11:26,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 221 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:11:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 04:11:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 04:11:26,759 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 04:11:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 04:11:26,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2023-02-18 04:11:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:11:26,759 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 04:11:26,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.242424242424242) internal successors, (74), 31 states have internal predecessors, (74), 30 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 29 states have call predecessors, (34), 30 states have call successors, (34) [2023-02-18 04:11:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 04:11:26,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 04:11:26,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 04:11:26,770 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 04:11:26,961 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 04:11:26,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 04:11:26,972 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 04:11:26,972 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse34 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse30 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse35 (+ .cse34 1))) (let ((.cse36 (+ .cse35 1)) (.cse32 (+ .cse30 1))) (let ((.cse24 (+ .cse32 1)) (.cse33 (+ .cse36 1))) (let ((.cse16 (+ 0 1)) (.cse17 (+ .cse33 1)) (.cse27 (+ .cse24 1))) (let ((.cse25 (< .cse36 |ULTIMATE.start_main_~k~0#1|)) (.cse29 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse23 (< .cse35 |ULTIMATE.start_main_~k~0#1|)) (.cse31 (< .cse34 |ULTIMATE.start_main_~k~0#1|)) (.cse19 (+ .cse27 1)) (.cse26 (< .cse33 |ULTIMATE.start_main_~k~0#1|)) (.cse20 (< .cse17 |ULTIMATE.start_main_~k~0#1|)) (.cse28 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse22 (= |ULTIMATE.start_main_~y~0#1| .cse16)) (.cse6 (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse11 (+ 4 1)) (.cse10 (+ (- 1) .cse6)) (.cse3 (+ 1 1)) (.cse12 (+ 3 1)) (.cse1 (+ 2 1)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse2 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 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|)) (+ (- (* (* |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| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse28)) 0) (and .cse22 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0)))) (.cse21 (or (= (* .cse19 .cse19) (* .cse19 |ULTIMATE.start_main_~k~0#1|)) (not .cse26) .cse20)) (.cse4 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse13 (or (= (* .cse32 .cse32) (* |ULTIMATE.start_main_~k~0#1| .cse32)) .cse23 (not .cse31))) (.cse7 (or (= (* .cse30 |ULTIMATE.start_main_~k~0#1|) (* .cse30 .cse30)) (not .cse29) .cse31)) (.cse8 (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse28) .cse29)) (.cse9 (<= |ULTIMATE.start_main_~k~0#1| 256)) (.cse14 (or .cse26 (not .cse25) (= (* .cse27 .cse27) (* .cse27 |ULTIMATE.start_main_~k~0#1|)))) (.cse15 (or (not .cse23) (= (* .cse24 |ULTIMATE.start_main_~k~0#1|) (* .cse24 .cse24)) .cse25))) (or (and .cse0 (= .cse1 |ULTIMATE.start_main_~c~0#1|) .cse2 (= .cse3 .cse4) (= .cse1 |ULTIMATE.start_main_~y~0#1|) .cse5 (= .cse3 .cse6) .cse7 .cse8 .cse9 (<= 2 .cse4)) (and .cse0 (= .cse10 .cse1) (<= 4 .cse4) .cse2 (= |ULTIMATE.start_main_~c~0#1| .cse11) .cse5 (= .cse3 (+ (- 1) .cse10)) (< .cse12 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse12 1))) (and .cse0 .cse2 (<= 7 .cse4) .cse5 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15) (and .cse0 (= .cse3 |ULTIMATE.start_main_~y~0#1|) .cse2 (<= 1 .cse4) (= .cse3 |ULTIMATE.start_main_~c~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse3) (= .cse10 0) .cse5 .cse13 .cse7 .cse8 .cse9 (= .cse4 .cse16)) (and .cse0 (<= 5 .cse4) (or (< (+ .cse17 1) |ULTIMATE.start_main_~k~0#1|) (let ((.cse18 (+ .cse19 1))) (= (* .cse18 .cse18) (* |ULTIMATE.start_main_~k~0#1| .cse18))) (not .cse20)) .cse2 .cse21 .cse5 .cse13 .cse7 (< .cse11 |ULTIMATE.start_main_~k~0#1|) .cse9 (= (+ 5 1) |ULTIMATE.start_main_~y~0#1|) .cse14 .cse15 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse11 1))) (and .cse0 (<= 0 .cse4) .cse2 (= .cse4 0) (= .cse6 0) .cse22 .cse5 (<= |ULTIMATE.start_main_~c~0#1| .cse16) (< 0 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse16)) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse5 .cse9 (= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse0 (<= 9 .cse4) .cse2 .cse5 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse5 .cse13 .cse7 .cse8 .cse9 (<= 8 .cse4) .cse15) (and (= .cse1 .cse4) .cse0 (= .cse10 .cse3) .cse2 (= |ULTIMATE.start_main_~c~0#1| .cse12) (<= 3 .cse4) .cse5 (= .cse6 .cse1) .cse8 .cse9) (and .cse0 .cse2 .cse21 (<= 6 .cse4) .cse5 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15))))))))) [2023-02-18 04:11:26,972 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-02-18 04:11:26,972 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-02-18 04:11:26,973 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| 10) (<= |ULTIMATE.start_main_~k~0#1| 256)) [2023-02-18 04:11:26,973 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 04:11:26,973 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 42) the Hoare annotation is: true [2023-02-18 04:11:26,973 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-02-18 04:11:26,973 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 04:11:26,973 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 04:11:26,973 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse34 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse30 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse35 (+ .cse34 1))) (let ((.cse36 (+ .cse35 1)) (.cse32 (+ .cse30 1))) (let ((.cse24 (+ .cse32 1)) (.cse33 (+ .cse36 1))) (let ((.cse16 (+ 0 1)) (.cse17 (+ .cse33 1)) (.cse27 (+ .cse24 1))) (let ((.cse25 (< .cse36 |ULTIMATE.start_main_~k~0#1|)) (.cse29 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse23 (< .cse35 |ULTIMATE.start_main_~k~0#1|)) (.cse31 (< .cse34 |ULTIMATE.start_main_~k~0#1|)) (.cse19 (+ .cse27 1)) (.cse26 (< .cse33 |ULTIMATE.start_main_~k~0#1|)) (.cse20 (< .cse17 |ULTIMATE.start_main_~k~0#1|)) (.cse28 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse22 (= |ULTIMATE.start_main_~y~0#1| .cse16)) (.cse6 (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse11 (+ 4 1)) (.cse10 (+ (- 1) .cse6)) (.cse3 (+ 1 1)) (.cse12 (+ 3 1)) (.cse1 (+ 2 1)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse2 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 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|)) (+ (- (* (* |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| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse28)) 0) (and .cse22 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0)))) (.cse21 (or (= (* .cse19 .cse19) (* .cse19 |ULTIMATE.start_main_~k~0#1|)) (not .cse26) .cse20)) (.cse4 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse13 (or (= (* .cse32 .cse32) (* |ULTIMATE.start_main_~k~0#1| .cse32)) .cse23 (not .cse31))) (.cse7 (or (= (* .cse30 |ULTIMATE.start_main_~k~0#1|) (* .cse30 .cse30)) (not .cse29) .cse31)) (.cse8 (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse28) .cse29)) (.cse9 (<= |ULTIMATE.start_main_~k~0#1| 256)) (.cse14 (or .cse26 (not .cse25) (= (* .cse27 .cse27) (* .cse27 |ULTIMATE.start_main_~k~0#1|)))) (.cse15 (or (not .cse23) (= (* .cse24 |ULTIMATE.start_main_~k~0#1|) (* .cse24 .cse24)) .cse25))) (or (and .cse0 (= .cse1 |ULTIMATE.start_main_~c~0#1|) .cse2 (= .cse3 .cse4) (= .cse1 |ULTIMATE.start_main_~y~0#1|) .cse5 (= .cse3 .cse6) .cse7 .cse8 .cse9 (<= 2 .cse4)) (and .cse0 (= .cse10 .cse1) (<= 4 .cse4) .cse2 (= |ULTIMATE.start_main_~c~0#1| .cse11) .cse5 (= .cse3 (+ (- 1) .cse10)) (< .cse12 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse12 1))) (and .cse0 .cse2 (<= 7 .cse4) .cse5 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15) (and .cse0 (= .cse3 |ULTIMATE.start_main_~y~0#1|) .cse2 (<= 1 .cse4) (= .cse3 |ULTIMATE.start_main_~c~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse3) (= .cse10 0) .cse5 .cse13 .cse7 .cse8 .cse9 (= .cse4 .cse16)) (and .cse0 (<= 5 .cse4) (or (< (+ .cse17 1) |ULTIMATE.start_main_~k~0#1|) (let ((.cse18 (+ .cse19 1))) (= (* .cse18 .cse18) (* |ULTIMATE.start_main_~k~0#1| .cse18))) (not .cse20)) .cse2 .cse21 .cse5 .cse13 .cse7 (< .cse11 |ULTIMATE.start_main_~k~0#1|) .cse9 (= (+ 5 1) |ULTIMATE.start_main_~y~0#1|) .cse14 .cse15 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse11 1))) (and .cse0 (<= 0 .cse4) .cse2 (= .cse4 0) (= .cse6 0) .cse22 .cse5 (<= |ULTIMATE.start_main_~c~0#1| .cse16) (< 0 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse16)) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse5 .cse9 (= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse0 (<= 9 .cse4) .cse2 .cse5 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse5 .cse13 .cse7 .cse8 .cse9 (<= 8 .cse4) .cse15) (and (= .cse1 .cse4) .cse0 (= .cse10 .cse3) .cse2 (= |ULTIMATE.start_main_~c~0#1| .cse12) (<= 3 .cse4) .cse5 (= .cse6 .cse1) .cse8 .cse9) (and .cse0 .cse2 .cse21 (<= 6 .cse4) .cse5 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15))))))))) [2023-02-18 04:11:26,974 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse32 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse16 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse31 (+ .cse32 1))) (let ((.cse30 (+ .cse31 1)) (.cse18 (+ .cse16 1))) (let ((.cse21 (+ .cse18 1)) (.cse29 (+ .cse30 1))) (let ((.cse27 (+ .cse29 1)) (.cse24 (+ .cse21 1)) (.cse13 (+ 0 1))) (let ((.cse17 (< .cse32 |ULTIMATE.start_main_~k~0#1|)) (.cse12 (= |ULTIMATE.start_main_~y~0#1| .cse13)) (.cse19 (< .cse31 |ULTIMATE.start_main_~k~0#1|)) (.cse22 (< .cse30 |ULTIMATE.start_main_~k~0#1|)) (.cse23 (< .cse29 |ULTIMATE.start_main_~k~0#1|)) (.cse25 (+ .cse24 1)) (.cse26 (< .cse27 |ULTIMATE.start_main_~k~0#1|)) (.cse20 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse11 (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse20)) (.cse1 (or (< (+ .cse27 1) |ULTIMATE.start_main_~k~0#1|) (let ((.cse28 (+ .cse25 1))) (= (* .cse28 .cse28) (* |ULTIMATE.start_main_~k~0#1| .cse28))) (not .cse26))) (.cse3 (or (= (* .cse25 .cse25) (* .cse25 |ULTIMATE.start_main_~k~0#1|)) (not .cse23) .cse26)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse9 (or .cse23 (not .cse22) (= (* .cse24 .cse24) (* .cse24 |ULTIMATE.start_main_~k~0#1|)))) (.cse10 (or (not .cse19) (= (* .cse21 |ULTIMATE.start_main_~k~0#1|) (* .cse21 .cse21)) .cse22)) (.cse2 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 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|)) (+ (- (* (* |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| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse20)) 0) (and .cse12 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0)))) (.cse14 (+ (- 1) (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (.cse5 (or (= (* .cse18 .cse18) (* |ULTIMATE.start_main_~k~0#1| .cse18)) .cse19 (not .cse17))) (.cse6 (or (= (* .cse16 |ULTIMATE.start_main_~k~0#1|) (* .cse16 .cse16)) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) .cse17)) (.cse8 (<= |ULTIMATE.start_main_~k~0#1| 256))) (or (let ((.cse7 (+ 4 1))) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~k~0#1| 6) .cse3 .cse4 .cse5 .cse6 (< .cse7 |ULTIMATE.start_main_~k~0#1|) .cse8 (= (+ 5 1) |ULTIMATE.start_main_~y~0#1|) .cse9 .cse10 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse7 1)))) (and .cse11 .cse2 .cse5 .cse6 .cse8) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and (<= |ULTIMATE.start_main_~k~0#1| 1) .cse2 .cse12 (<= |ULTIMATE.start_main_~c~0#1| .cse13) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse15 (+ 3 1))) (and (= .cse14 (+ 2 1)) .cse2 (<= |ULTIMATE.start_main_~k~0#1| 5) .cse5 (< .cse15 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse8 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse15 1)))) (and (<= |ULTIMATE.start_main_~k~0#1| 2) .cse2 (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 1)) (= .cse14 0) .cse5 .cse6 .cse8))))))))) [2023-02-18 04:11:26,974 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-02-18 04:11:26,974 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse32 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse16 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse31 (+ .cse32 1))) (let ((.cse30 (+ .cse31 1)) (.cse18 (+ .cse16 1))) (let ((.cse21 (+ .cse18 1)) (.cse29 (+ .cse30 1))) (let ((.cse27 (+ .cse29 1)) (.cse24 (+ .cse21 1)) (.cse13 (+ 0 1))) (let ((.cse17 (< .cse32 |ULTIMATE.start_main_~k~0#1|)) (.cse12 (= |ULTIMATE.start_main_~y~0#1| .cse13)) (.cse19 (< .cse31 |ULTIMATE.start_main_~k~0#1|)) (.cse22 (< .cse30 |ULTIMATE.start_main_~k~0#1|)) (.cse23 (< .cse29 |ULTIMATE.start_main_~k~0#1|)) (.cse25 (+ .cse24 1)) (.cse26 (< .cse27 |ULTIMATE.start_main_~k~0#1|)) (.cse20 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse11 (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse20)) (.cse1 (or (< (+ .cse27 1) |ULTIMATE.start_main_~k~0#1|) (let ((.cse28 (+ .cse25 1))) (= (* .cse28 .cse28) (* |ULTIMATE.start_main_~k~0#1| .cse28))) (not .cse26))) (.cse3 (or (= (* .cse25 .cse25) (* .cse25 |ULTIMATE.start_main_~k~0#1|)) (not .cse23) .cse26)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse9 (or .cse23 (not .cse22) (= (* .cse24 .cse24) (* .cse24 |ULTIMATE.start_main_~k~0#1|)))) (.cse10 (or (not .cse19) (= (* .cse21 |ULTIMATE.start_main_~k~0#1|) (* .cse21 .cse21)) .cse22)) (.cse2 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 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|)) (+ (- (* (* |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| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse20)) 0) (and .cse12 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0)))) (.cse14 (+ (- 1) (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (.cse5 (or (= (* .cse18 .cse18) (* |ULTIMATE.start_main_~k~0#1| .cse18)) .cse19 (not .cse17))) (.cse6 (or (= (* .cse16 |ULTIMATE.start_main_~k~0#1|) (* .cse16 .cse16)) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) .cse17)) (.cse8 (<= |ULTIMATE.start_main_~k~0#1| 256))) (or (let ((.cse7 (+ 4 1))) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~k~0#1| 6) .cse3 .cse4 .cse5 .cse6 (< .cse7 |ULTIMATE.start_main_~k~0#1|) .cse8 (= (+ 5 1) |ULTIMATE.start_main_~y~0#1|) .cse9 .cse10 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse7 1)))) (and .cse11 .cse2 .cse5 .cse6 .cse8) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and (<= |ULTIMATE.start_main_~k~0#1| 1) .cse2 .cse12 (<= |ULTIMATE.start_main_~c~0#1| .cse13) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse15 (+ 3 1))) (and (= .cse14 (+ 2 1)) .cse2 (<= |ULTIMATE.start_main_~k~0#1| 5) .cse5 (< .cse15 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse8 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse15 1)))) (and (<= |ULTIMATE.start_main_~k~0#1| 2) .cse2 (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 1)) (= .cse14 0) .cse5 .cse6 .cse8))))))))) [2023-02-18 04:11:26,974 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-02-18 04:11:26,974 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-18 04:11:26,975 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-02-18 04:11:26,975 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-02-18 04:11:26,975 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-18 04:11:26,975 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-18 04:11:26,975 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-18 04:11:26,975 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-18 04:11:26,975 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-18 04:11:26,975 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-18 04:11:26,977 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-02-18 04:11:26,979 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 04:11:27,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:11:27 BoogieIcfgContainer [2023-02-18 04:11:27,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 04:11:27,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 04:11:27,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 04:11:27,018 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 04:11:27,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:11:02" (3/4) ... [2023-02-18 04:11:27,021 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 04:11:27,025 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 04:11:27,025 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 04:11:27,028 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 04:11:27,028 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 04:11:27,028 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 04:11:27,028 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 04:11:27,053 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 04:11:27,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 04:11:27,053 INFO L158 Benchmark]: Toolchain (without parser) took 25142.67ms. Allocated memory is still 216.0MB. Free memory was 177.9MB in the beginning and 145.1MB in the end (delta: 32.8MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2023-02-18 04:11:27,053 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:11:27,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.14ms. Allocated memory is still 216.0MB. Free memory was 177.9MB in the beginning and 167.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 04:11:27,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.13ms. Allocated memory is still 216.0MB. Free memory was 167.4MB in the beginning and 165.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:11:27,054 INFO L158 Benchmark]: Boogie Preprocessor took 30.83ms. Allocated memory is still 216.0MB. Free memory was 165.3MB in the beginning and 164.6MB in the end (delta: 727.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:11:27,054 INFO L158 Benchmark]: RCFGBuilder took 235.70ms. Allocated memory is still 216.0MB. Free memory was 164.6MB in the beginning and 154.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 04:11:27,055 INFO L158 Benchmark]: TraceAbstraction took 24622.52ms. Allocated memory is still 216.0MB. Free memory was 153.4MB in the beginning and 148.2MB in the end (delta: 5.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2023-02-18 04:11:27,055 INFO L158 Benchmark]: Witness Printer took 34.84ms. Allocated memory is still 216.0MB. Free memory was 148.2MB in the beginning and 145.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:11:27,056 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 142.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.14ms. Allocated memory is still 216.0MB. Free memory was 177.9MB in the beginning and 167.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.13ms. Allocated memory is still 216.0MB. Free memory was 167.4MB in the beginning and 165.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.83ms. Allocated memory is still 216.0MB. Free memory was 165.3MB in the beginning and 164.6MB in the end (delta: 727.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 235.70ms. Allocated memory is still 216.0MB. Free memory was 164.6MB in the beginning and 154.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24622.52ms. Allocated memory is still 216.0MB. Free memory was 153.4MB in the beginning and 148.2MB in the end (delta: 5.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 34.84ms. Allocated memory is still 216.0MB. Free memory was 148.2MB in the beginning and 145.1MB in the end (delta: 3.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: 24.5s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 1227 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 998 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1373 IncrementalHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 229 mSDtfsCounter, 1373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 715 GetRequests, 562 SyntacticMatches, 6 SemanticMatches, 147 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=7, InterpolantAutomatonStates: 97, 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, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 43 PreInvPairs, 81 NumberOfFragments, 6502 HoareAnnotationTreeSize, 43 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 413 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 642 ConstructedInterpolants, 0 QuantifiedInterpolants, 3735 SizeOfPredicates, 26 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1914/2130 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 >= 0 && 2 + 1 == c) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && 1 + 1 == -1 + c) && 2 + 1 == y) && k <= 10) && 1 + 1 == -1 + y) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && 2 <= -1 + c) || ((((((((((k >= 0 && -1 + (-1 + y) == 2 + 1) && 4 <= -1 + c) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && c == 4 + 1) && k <= 10) && 1 + 1 == -1 + (-1 + (-1 + y))) && 3 + 1 < k) && (k * y == y * y || c < k)) && k <= 256) && c <= 3 + 1 + 1)) || (((((((((k >= 0 && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && 7 <= -1 + c) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && ((c + 1 + 1 + 1 + 1 < k || !(c + 1 + 1 + 1 < k)) || (y + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1) * k)) && ((!(c + 1 + 1 < k) || (y + 1 + 1 + 1) * k == (y + 1 + 1 + 1) * (y + 1 + 1 + 1)) || c + 1 + 1 + 1 < k))) || (((((((((((((k >= 0 && 1 + 1 == y) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && 1 <= -1 + c) && 1 + 1 == c) && 1 < k) && c <= 1 + 1) && -1 + (-1 + y) == 0) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && -1 + c == 0 + 1)) || (((((((((((((k >= 0 && 5 <= -1 + c) && ((c + 1 + 1 + 1 + 1 + 1 + 1 < k || (y + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1) == k * (y + 1 + 1 + 1 + 1 + 1 + 1)) || !(c + 1 + 1 + 1 + 1 + 1 < k))) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && (((y + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1 + 1) * k || !(c + 1 + 1 + 1 + 1 < k)) || c + 1 + 1 + 1 + 1 + 1 < k)) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && 4 + 1 < k) && k <= 256) && 5 + 1 == y) && ((c + 1 + 1 + 1 + 1 < k || !(c + 1 + 1 + 1 < k)) || (y + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1) * k)) && ((!(c + 1 + 1 < k) || (y + 1 + 1 + 1) * k == (y + 1 + 1 + 1) * (y + 1 + 1 + 1)) || c + 1 + 1 + 1 < k)) && c <= 4 + 1 + 1)) || (((((((((((k >= 0 && 0 <= -1 + c) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && -1 + c == 0) && -1 + y == 0) && y == 0 + 1) && k <= 10) && c <= 0 + 1) && 0 < k) && (k * y == y * y || c < k)) && k <= 256) && c == 0 + 1)) || ((((((c == 0 && k >= 0) && y == 0) && c >= 0) && k <= 10) && k <= 256) && x == 0)) || (((((((k >= 0 && 9 <= -1 + c) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256)) || ((((((((k >= 0 && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && 8 <= -1 + c) && ((!(c + 1 + 1 < k) || (y + 1 + 1 + 1) * k == (y + 1 + 1 + 1) * (y + 1 + 1 + 1)) || c + 1 + 1 + 1 < k))) || (((((((((2 + 1 == -1 + c && k >= 0) && -1 + (-1 + y) == 1 + 1) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && c == 3 + 1) && 3 <= -1 + c) && k <= 10) && -1 + y == 2 + 1) && (k * y == y * y || c < k)) && k <= 256)) || ((((((((((k >= 0 && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && (((y + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1 + 1) * k || !(c + 1 + 1 + 1 + 1 < k)) || c + 1 + 1 + 1 + 1 + 1 < k)) && 6 <= -1 + c) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && ((c + 1 + 1 + 1 + 1 < k || !(c + 1 + 1 + 1 < k)) || (y + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1) * k)) && ((!(c + 1 + 1 < k) || (y + 1 + 1 + 1) * k == (y + 1 + 1 + 1) * (y + 1 + 1 + 1)) || c + 1 + 1 + 1 < k)) RESULT: Ultimate proved your program to be correct! [2023-02-18 04:11:27,086 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