./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-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/ps4-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 53086523abe0dc699ccd28b0916f17f8825d4641577f06835b9d81e9579a444f --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 03:56:08,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 03:56:08,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 03:56:08,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 03:56:08,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 03:56:08,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 03:56:08,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 03:56:08,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 03:56:08,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 03:56:08,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 03:56:08,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 03:56:08,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 03:56:08,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 03:56:08,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 03:56:08,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 03:56:08,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 03:56:08,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 03:56:08,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 03:56:08,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 03:56:08,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 03:56:08,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 03:56:08,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 03:56:08,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 03:56:08,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 03:56:08,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 03:56:08,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 03:56:08,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 03:56:08,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 03:56:08,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 03:56:08,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 03:56:08,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 03:56:08,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 03:56:08,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 03:56:08,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 03:56:08,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 03:56:08,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 03:56:08,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 03:56:08,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 03:56:08,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 03:56:08,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 03:56:08,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 03:56:08,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 03:56:08,582 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 03:56:08,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 03:56:08,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 03:56:08,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 03:56:08,586 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 03:56:08,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 03:56:08,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 03:56:08,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 03:56:08,587 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 03:56:08,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 03:56:08,588 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 03:56:08,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 03:56:08,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 03:56:08,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 03:56:08,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 03:56:08,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 03:56:08,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 03:56:08,589 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 03:56:08,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 03:56:08,589 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 03:56:08,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 03:56:08,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 03:56:08,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 03:56:08,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 03:56:08,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:56:08,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 03:56:08,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 03:56:08,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 03:56:08,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 03:56:08,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 03:56:08,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 03:56:08,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 03:56:08,592 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 03:56:08,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 03:56:08,592 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 03:56:08,593 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 -> 53086523abe0dc699ccd28b0916f17f8825d4641577f06835b9d81e9579a444f [2023-02-18 03:56:08,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 03:56:08,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 03:56:08,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 03:56:08,798 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 03:56:08,798 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 03:56:08,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound10.c [2023-02-18 03:56:09,674 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 03:56:09,856 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 03:56:09,856 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound10.c [2023-02-18 03:56:09,860 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ed60aac/f193d194beea432cb73a9cff54b77671/FLAG36c2c6763 [2023-02-18 03:56:09,869 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ed60aac/f193d194beea432cb73a9cff54b77671 [2023-02-18 03:56:09,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 03:56:09,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 03:56:09,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 03:56:09,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 03:56:09,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 03:56:09,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:56:09" (1/1) ... [2023-02-18 03:56:09,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d889700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:09, skipping insertion in model container [2023-02-18 03:56:09,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:56:09" (1/1) ... [2023-02-18 03:56:09,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 03:56:09,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 03:56:09,980 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/ps4-ll_valuebound10.c[458,471] [2023-02-18 03:56:09,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:56:09,994 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 03:56:10,002 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/ps4-ll_valuebound10.c[458,471] [2023-02-18 03:56:10,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:56:10,013 INFO L208 MainTranslator]: Completed translation [2023-02-18 03:56:10,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10 WrapperNode [2023-02-18 03:56:10,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 03:56:10,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 03:56:10,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 03:56:10,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 03:56:10,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,032 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2023-02-18 03:56:10,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 03:56:10,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 03:56:10,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 03:56:10,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 03:56:10,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 03:56:10,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 03:56:10,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 03:56:10,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 03:56:10,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (1/1) ... [2023-02-18 03:56:10,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:56:10,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:56:10,067 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 03:56:10,069 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 03:56:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 03:56:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 03:56:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 03:56:10,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 03:56:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 03:56:10,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 03:56:10,132 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 03:56:10,133 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 03:56:10,224 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 03:56:10,227 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 03:56:10,228 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 03:56:10,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:56:10 BoogieIcfgContainer [2023-02-18 03:56:10,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 03:56:10,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 03:56:10,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 03:56:10,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 03:56:10,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 03:56:09" (1/3) ... [2023-02-18 03:56:10,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d9bfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:56:10, skipping insertion in model container [2023-02-18 03:56:10,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:56:10" (2/3) ... [2023-02-18 03:56:10,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d9bfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:56:10, skipping insertion in model container [2023-02-18 03:56:10,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:56:10" (3/3) ... [2023-02-18 03:56:10,235 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound10.c [2023-02-18 03:56:10,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 03:56:10,247 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 03:56:10,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 03:56:10,282 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;@179920e3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 03:56:10,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 03:56:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:56:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 03:56:10,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:56:10,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:56:10,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:56:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:56:10,293 INFO L85 PathProgramCache]: Analyzing trace with hash -589436290, now seen corresponding path program 1 times [2023-02-18 03:56:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:56:10,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83635447] [2023-02-18 03:56:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:56:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:56:10,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:56:10,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83635447] [2023-02-18 03:56:10,390 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 03:56:10,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088454514] [2023-02-18 03:56:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:10,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:56:10,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:56:10,406 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 03:56:10,408 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 03:56:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:56:10,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 03:56:10,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:56:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:56:10,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:56:10,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088454514] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:56:10,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:56:10,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 03:56:10,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223199689] [2023-02-18 03:56:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:56:10,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 03:56:10,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:56:10,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 03:56:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 03:56:10,526 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:56:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:56:10,538 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2023-02-18 03:56:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 03:56:10,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 03:56:10,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:56:10,550 INFO L225 Difference]: With dead ends: 35 [2023-02-18 03:56:10,551 INFO L226 Difference]: Without dead ends: 15 [2023-02-18 03:56:10,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 03:56:10,556 INFO L413 NwaCegarLoop]: 21 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, 21 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 03:56:10,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:56:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-18 03:56:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-18 03:56:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:56:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-18 03:56:10,582 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2023-02-18 03:56:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:56:10,582 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-18 03:56:10,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:56:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-18 03:56:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 03:56:10,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:56:10,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:56:10,590 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 03:56:10,792 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 03:56:10,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:56:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:56:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1187358532, now seen corresponding path program 1 times [2023-02-18 03:56:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:56:10,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516013955] [2023-02-18 03:56:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:56:10,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:56:10,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996637944] [2023-02-18 03:56:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:10,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:56:10,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:56:10,826 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 03:56:10,827 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 03:56:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:56:10,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 03:56:10,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:56:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:56:10,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:56:10,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:56:10,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516013955] [2023-02-18 03:56:10,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:56:10,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996637944] [2023-02-18 03:56:10,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996637944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:56:10,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:56:10,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 03:56:10,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538749445] [2023-02-18 03:56:10,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:56:10,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 03:56:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:56:10,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 03:56:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 03:56:10,954 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:56:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:56:11,112 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-02-18 03:56:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 03:56:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 03:56:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:56:11,113 INFO L225 Difference]: With dead ends: 26 [2023-02-18 03:56:11,113 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 03:56:11,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 03:56:11,114 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:56:11,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 45 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:56:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 03:56:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 03:56:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:56:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-18 03:56:11,119 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2023-02-18 03:56:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:56:11,119 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-18 03:56:11,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:56:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-18 03:56:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 03:56:11,120 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:56:11,120 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:56:11,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 03:56:11,325 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 03:56:11,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:56:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:56:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1781398469, now seen corresponding path program 1 times [2023-02-18 03:56:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:56:11,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534184926] [2023-02-18 03:56:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:11,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:56:11,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:56:11,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930059352] [2023-02-18 03:56:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:11,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:56:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:56:11,335 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 03:56:11,337 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 03:56:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:56:11,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 03:56:11,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:56:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:56:11,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:56:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:56:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:56:11,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534184926] [2023-02-18 03:56:11,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:56:11,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930059352] [2023-02-18 03:56:11,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930059352] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:56:11,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:56:11,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-18 03:56:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605868785] [2023-02-18 03:56:11,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:56:11,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 03:56:11,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:56:11,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 03:56:11,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 03:56:11,661 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:56:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:56:11,755 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-18 03:56:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 03:56:11,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-02-18 03:56:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:56:11,756 INFO L225 Difference]: With dead ends: 33 [2023-02-18 03:56:11,756 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 03:56:11,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-18 03:56:11,757 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:56:11,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:56:11,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 03:56:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-02-18 03:56:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:56:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2023-02-18 03:56:11,764 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2023-02-18 03:56:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:56:11,764 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2023-02-18 03:56:11,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:56:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2023-02-18 03:56:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 03:56:11,765 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:56:11,765 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:56:11,771 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 03:56:11,969 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 03:56:11,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:56:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:56:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1711372296, now seen corresponding path program 1 times [2023-02-18 03:56:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:56:11,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235028875] [2023-02-18 03:56:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:56:11,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:56:11,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [225449900] [2023-02-18 03:56:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:11,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:56:11,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:56:11,978 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 03:56:11,979 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 03:56:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:56:12,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 03:56:12,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:56:14,056 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1))) (and (< 0 |c_ULTIMATE.start_main_~k~0#1|) (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |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|)) 4) 0) (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (<= |c_ULTIMATE.start_main_~c~0#1| .cse0))) is different from true [2023-02-18 03:56:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-02-18 03:56:16,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:56:29,924 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_3| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|))) (or (= (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (- .cse0)) 0) (= (mod (+ .cse0 (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|)) 4) 0))))) is different from true [2023-02-18 03:56:35,959 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_3| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|))) (or (= (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (- .cse0)) 0) (= (mod (+ .cse0 (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|)) 4) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 03:56:37,969 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |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|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:56:37,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:56:37,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235028875] [2023-02-18 03:56:37,976 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:56:37,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225449900] [2023-02-18 03:56:37,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225449900] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:56:37,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:56:37,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 03:56:37,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515067477] [2023-02-18 03:56:37,977 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:56:37,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 03:56:37,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:56:37,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 03:56:37,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=122, Unknown=6, NotChecked=100, Total=272 [2023-02-18 03:56:37,978 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:56:39,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:56:41,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:56:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:56:43,791 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-02-18 03:56:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 03:56:43,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-02-18 03:56:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:56:43,792 INFO L225 Difference]: With dead ends: 31 [2023-02-18 03:56:43,792 INFO L226 Difference]: Without dead ends: 26 [2023-02-18 03:56:43,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=57, Invalid=163, Unknown=6, NotChecked=116, Total=342 [2023-02-18 03:56:43,793 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-18 03:56:43,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 1 Unknown, 21 Unchecked, 3.8s Time] [2023-02-18 03:56:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-18 03:56:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-18 03:56:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:56:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-02-18 03:56:43,798 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2023-02-18 03:56:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:56:43,798 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-02-18 03:56:43,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:56:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-02-18 03:56:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 03:56:43,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:56:43,799 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:56:43,811 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 03:56:44,003 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 03:56:44,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:56:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:56:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1075497887, now seen corresponding path program 2 times [2023-02-18 03:56:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:56:44,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592197749] [2023-02-18 03:56:44,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:56:44,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:56:44,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442139342] [2023-02-18 03:56:44,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 03:56:44,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:56:44,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:56:44,029 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 03:56:44,031 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 03:56:44,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 03:56:44,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:56:44,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 03:56:44,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:56:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 03:56:44,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:56:46,183 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |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|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:56:46,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:56:46,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592197749] [2023-02-18 03:56:46,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:56:46,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442139342] [2023-02-18 03:56:46,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442139342] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:56:46,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:56:46,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 03:56:46,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386346028] [2023-02-18 03:56:46,185 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:56:46,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 03:56:46,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:56:46,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 03:56:46,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2023-02-18 03:56:46,186 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:56:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:56:46,287 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-02-18 03:56:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 03:56:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-02-18 03:56:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:56:46,288 INFO L225 Difference]: With dead ends: 34 [2023-02-18 03:56:46,288 INFO L226 Difference]: Without dead ends: 29 [2023-02-18 03:56:46,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2023-02-18 03:56:46,289 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:56:46,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:56:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-18 03:56:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-18 03:56:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 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 03:56:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-18 03:56:46,294 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2023-02-18 03:56:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:56:46,294 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-18 03:56:46,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:56:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-18 03:56:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 03:56:46,295 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:56:46,295 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:56:46,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 03:56:46,502 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 03:56:46,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:56:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:56:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash 817917912, now seen corresponding path program 3 times [2023-02-18 03:56:46,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:56:46,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48942493] [2023-02-18 03:56:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:56:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:56:46,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:56:46,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409071052] [2023-02-18 03:56:46,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 03:56:46,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:56:46,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:56:46,515 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 03:56:46,517 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 03:56:46,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 03:56:46,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:56:46,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 03:56:46,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:56:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 03:56:46,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:56:54,707 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_9| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|))) (or (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_9|)) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 2) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|)) 4) 0))))) is different from true [2023-02-18 03:57:00,727 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_9| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|))) (or (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_9|)) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 2) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|)) 4) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 03:57:02,735 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |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|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:57:02,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:57:02,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48942493] [2023-02-18 03:57:02,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:57:02,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409071052] [2023-02-18 03:57:02,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409071052] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:57:02,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:57:02,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 03:57:02,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151688063] [2023-02-18 03:57:02,742 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:57:02,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 03:57:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:57:02,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 03:57:02,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=171, Unknown=5, NotChecked=84, Total=306 [2023-02-18 03:57:02,743 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 03:57:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:57:02,850 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-02-18 03:57:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 03:57:02,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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) Word has length 36 [2023-02-18 03:57:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:57:02,851 INFO L225 Difference]: With dead ends: 37 [2023-02-18 03:57:02,851 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 03:57:02,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=66, Invalid=247, Unknown=5, NotChecked=102, Total=420 [2023-02-18 03:57:02,852 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:57:02,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 94 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:57:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 03:57:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-18 03:57:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 03:57:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-18 03:57:02,857 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-18 03:57:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:57:02,857 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-18 03:57:02,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 03:57:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-18 03:57:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 03:57:02,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:57:02,858 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:57:02,865 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 03:57:03,059 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 03:57:03,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:57:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:57:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1384689793, now seen corresponding path program 4 times [2023-02-18 03:57:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:57:03,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787382463] [2023-02-18 03:57:03,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:03,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:57:03,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:57:03,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127794058] [2023-02-18 03:57:03,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 03:57:03,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:03,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:03,067 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 03:57:03,069 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 03:57:03,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 03:57:03,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:57:03,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 03:57:03,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:57:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-18 03:57:03,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:57:11,231 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|))) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12|) (- .cse0)) 0) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| 2)) 4) 0))))) is different from true [2023-02-18 03:57:17,247 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_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|))) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12|) (- .cse0)) 0) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| 2)) 4) 0))))) is different from true [2023-02-18 03:57:19,258 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |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|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:57:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:57:19,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787382463] [2023-02-18 03:57:19,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:57:19,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127794058] [2023-02-18 03:57:19,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127794058] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:57:19,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:57:19,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-02-18 03:57:19,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235299880] [2023-02-18 03:57:19,263 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:57:19,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 03:57:19,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:57:19,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 03:57:19,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=200, Unknown=4, NotChecked=90, Total=342 [2023-02-18 03:57:19,264 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 03:57:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:57:19,394 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-02-18 03:57:19,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 03:57:19,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 43 [2023-02-18 03:57:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:57:19,395 INFO L225 Difference]: With dead ends: 40 [2023-02-18 03:57:19,395 INFO L226 Difference]: Without dead ends: 35 [2023-02-18 03:57:19,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=68, Invalid=282, Unknown=4, NotChecked=108, Total=462 [2023-02-18 03:57:19,396 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:57:19,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:57:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-18 03:57:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-18 03:57:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:57:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-18 03:57:19,402 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2023-02-18 03:57:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:57:19,403 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-18 03:57:19,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 03:57:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-18 03:57:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 03:57:19,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:57:19,404 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:57:19,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 03:57:19,604 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 03:57:19,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:57:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:57:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash -23130184, now seen corresponding path program 5 times [2023-02-18 03:57:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:57:19,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158067799] [2023-02-18 03:57:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:57:19,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:57:19,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159041381] [2023-02-18 03:57:19,611 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 03:57:19,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:19,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:19,612 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 03:57:19,614 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 03:57:19,654 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-18 03:57:19,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:57:19,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-18 03:57:19,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:57:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 58 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-18 03:57:19,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:57:19,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:57:19,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158067799] [2023-02-18 03:57:19,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:57:19,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159041381] [2023-02-18 03:57:19,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159041381] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:57:19,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:57:19,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-18 03:57:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956175154] [2023-02-18 03:57:19,804 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:57:19,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 03:57:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:57:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 03:57:19,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-02-18 03:57:19,805 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:57:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:57:19,961 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-02-18 03:57:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 03:57:19,962 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2023-02-18 03:57:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:57:19,962 INFO L225 Difference]: With dead ends: 43 [2023-02-18 03:57:19,962 INFO L226 Difference]: Without dead ends: 38 [2023-02-18 03:57:19,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 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 03:57:19,963 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:57:19,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 136 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:57:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-18 03:57:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-18 03:57:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 03:57:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-18 03:57:19,969 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2023-02-18 03:57:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:57:19,970 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-18 03:57:19,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:57:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-18 03:57:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 03:57:19,971 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:57:19,971 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:57:19,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-18 03:57:20,175 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 03:57:20,175 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:57:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:57:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1898941279, now seen corresponding path program 6 times [2023-02-18 03:57:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:57:20,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555943362] [2023-02-18 03:57:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:57:20,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:57:20,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106854473] [2023-02-18 03:57:20,187 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 03:57:20,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:20,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:20,188 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:57:20,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 03:57:20,249 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-02-18 03:57:20,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:57:20,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-18 03:57:20,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:57:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-18 03:57:20,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:57:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-18 03:57:20,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:57:20,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555943362] [2023-02-18 03:57:20,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:57:20,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106854473] [2023-02-18 03:57:20,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106854473] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:57:20,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:57:20,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-02-18 03:57:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631631122] [2023-02-18 03:57:20,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:57:20,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-18 03:57:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:57:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-18 03:57:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2023-02-18 03:57:20,538 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 16 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 03:57:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:57:21,154 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2023-02-18 03:57:21,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-18 03:57:21,155 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 16 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 57 [2023-02-18 03:57:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:57:21,155 INFO L225 Difference]: With dead ends: 69 [2023-02-18 03:57:21,156 INFO L226 Difference]: Without dead ends: 63 [2023-02-18 03:57:21,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=371, Invalid=1351, Unknown=0, NotChecked=0, Total=1722 [2023-02-18 03:57:21,157 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 93 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 03:57:21,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 180 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 03:57:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-18 03:57:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-18 03:57:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 03:57:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2023-02-18 03:57:21,170 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 57 [2023-02-18 03:57:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:57:21,170 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2023-02-18 03:57:21,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 16 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 03:57:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2023-02-18 03:57:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-02-18 03:57:21,172 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:57:21,172 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:57:21,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 03:57:21,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:21,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:57:21,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:57:21,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1794064584, now seen corresponding path program 7 times [2023-02-18 03:57:21,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:57:21,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551332014] [2023-02-18 03:57:21,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:21,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:57:21,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:57:21,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805503344] [2023-02-18 03:57:21,383 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 03:57:21,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:21,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:21,385 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:57:21,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 03:57:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:57:21,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 03:57:21,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:57:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2023-02-18 03:57:21,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:57:21,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:57:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551332014] [2023-02-18 03:57:21,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:57:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805503344] [2023-02-18 03:57:21,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805503344] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:57:21,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:57:21,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-18 03:57:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631384968] [2023-02-18 03:57:21,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:57:21,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 03:57:21,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:57:21,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 03:57:21,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2023-02-18 03:57:21,578 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 03:57:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:57:21,681 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2023-02-18 03:57:21,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 03:57:21,682 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 106 [2023-02-18 03:57:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:57:21,682 INFO L225 Difference]: With dead ends: 67 [2023-02-18 03:57:21,682 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 03:57:21,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=302, Invalid=510, Unknown=0, NotChecked=0, Total=812 [2023-02-18 03:57:21,684 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 03:57:21,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 144 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:57:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 03:57:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 03:57:21,685 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 03:57:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 03:57:21,686 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2023-02-18 03:57:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:57:21,686 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 03:57:21,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 03:57:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 03:57:21,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 03:57:21,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 03:57:21,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-18 03:57:21,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 03:57:21,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 03:57:21,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 03:57:21,905 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse49 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse44 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse50 (+ .cse49 1))) (let ((.cse47 (+ .cse50 1)) (.cse42 (+ .cse44 1))) (let ((.cse41 (+ .cse42 1)) (.cse48 (+ .cse47 1)) (.cse27 (+ 0 1))) (let ((.cse2 (+ 2 1)) (.cse32 (+ .cse27 1)) (.cse22 (+ .cse48 1)) (.cse46 (+ .cse41 1)) (.cse36 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse33 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse35 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse34 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (.cse38 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse6 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse8 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse37 (- .cse38)) (.cse29 (or .cse35 .cse34)) (.cse26 (= |ULTIMATE.start_main_~y~0#1| .cse27)) (.cse28 (= 0 .cse33)) (.cse39 (< .cse50 |ULTIMATE.start_main_~k~0#1|)) (.cse24 (not .cse36)) (.cse43 (< .cse49 |ULTIMATE.start_main_~k~0#1|)) (.cse21 (+ .cse46 1)) (.cse23 (< .cse22 |ULTIMATE.start_main_~k~0#1|)) (.cse45 (< .cse48 |ULTIMATE.start_main_~k~0#1|)) (.cse40 (< .cse47 |ULTIMATE.start_main_~k~0#1|)) (.cse7 (+ 1 1)) (.cse4 (+ .cse32 1)) (.cse30 (+ .cse2 1)) (.cse31 (+ 3 1))) (let ((.cse19 (+ .cse31 1)) (.cse18 (+ .cse30 1)) (.cse17 (+ .cse4 1)) (.cse1 (+ .cse7 1)) (.cse14 (or .cse45 (not .cse40) (= (+ (- (* .cse46 .cse46)) (* .cse46 |ULTIMATE.start_main_~k~0#1|)) 0))) (.cse25 (or (not .cse45) (= (+ (- (* .cse21 .cse21)) (* .cse21 |ULTIMATE.start_main_~k~0#1|)) 0) .cse23)) (.cse13 (or (= (+ (- (* .cse44 .cse44)) (* .cse44 |ULTIMATE.start_main_~k~0#1|)) 0) .cse24 .cse43)) (.cse15 (or (= (+ (- (* .cse42 .cse42)) (* |ULTIMATE.start_main_~k~0#1| .cse42)) 0) .cse39 (not .cse43))) (.cse16 (or (not .cse39) .cse40 (= (+ (- (* .cse41 .cse41)) (* .cse41 |ULTIMATE.start_main_~k~0#1|)) 0))) (.cse3 (or (and (= (+ (+ (- (* (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| .cse38) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) .cse37) 0) .cse29) (and .cse29 .cse26 .cse28))) (.cse5 (or .cse36 (= (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse37) 0))) (.cse11 (+ (- 1) .cse8)) (.cse9 (< 0 |ULTIMATE.start_main_~k~0#1|)) (.cse10 (or (and .cse34 (or (not .cse0) (not .cse6))) (and .cse35 .cse0 .cse6))) (.cse12 (+ (- 1) |ULTIMATE.start_main_~c~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| .cse1) (= .cse2 |ULTIMATE.start_main_~c~0#1|) .cse3 (= .cse4 |ULTIMATE.start_main_~c~0#1|) (= .cse2 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse2) .cse5 .cse6 (= .cse7 .cse8) .cse9 (< 2 |ULTIMATE.start_main_~k~0#1|) .cse10 (= (+ (- 1) .cse11) 0) (<= 2 .cse12)) (and .cse0 .cse13 .cse3 .cse14 .cse5 (<= 7 .cse12) .cse6 .cse10 .cse15 .cse16) (and .cse0 (<= 4 .cse12) .cse3 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse17 1)) (= .cse18 |ULTIMATE.start_main_~c~0#1|) .cse5 (< .cse17 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse9 .cse10 (= .cse19 |ULTIMATE.start_main_~y~0#1|)) (and .cse0 (<= 5 .cse12) .cse13 .cse3 .cse14 (= |ULTIMATE.start_main_~y~0#1| (+ .cse19 1)) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse18 1)) (or (= (let ((.cse20 (+ .cse21 1))) (+ (- (* .cse20 .cse20)) (* |ULTIMATE.start_main_~k~0#1| .cse20))) 0) (< (+ .cse22 1) |ULTIMATE.start_main_~k~0#1|) (not .cse23) .cse24) (< .cse18 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse25 .cse9 .cse10 .cse15 .cse16) (and .cse0 (<= 0 .cse12) .cse3 (= .cse12 0) (= .cse8 0) .cse26 .cse6 (<= |ULTIMATE.start_main_~c~0#1| .cse27) .cse9 .cse10 .cse28 (= |ULTIMATE.start_main_~c~0#1| .cse27)) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse29 .cse6 .cse10 (= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse0 (<= 9 .cse12) .cse13 .cse3 .cse5 .cse6 .cse10 .cse15) (and .cse0 (= .cse11 .cse7) (= .cse17 |ULTIMATE.start_main_~c~0#1|) .cse3 (= |ULTIMATE.start_main_~c~0#1| .cse30) (= |ULTIMATE.start_main_~y~0#1| .cse31) (<= 3 .cse12) .cse5 .cse6 (< .cse1 |ULTIMATE.start_main_~k~0#1|) .cse9 .cse10 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse1 1))) (and .cse0 .cse13 .cse3 .cse14 (<= 6 .cse12) .cse5 .cse6 .cse25 .cse10 .cse15 .cse16) (and .cse0 .cse13 .cse3 .cse5 .cse6 .cse10 .cse15 (<= 8 .cse12) .cse16) (and .cse0 (= .cse7 |ULTIMATE.start_main_~y~0#1|) .cse3 (<= 1 .cse12) (= .cse7 |ULTIMATE.start_main_~c~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) .cse12) 0) (<= |ULTIMATE.start_main_~c~0#1| .cse7) .cse5 (= .cse11 0) (= .cse32 |ULTIMATE.start_main_~c~0#1|) .cse6 (= (+ (* (- 1) .cse8 .cse8 .cse8) .cse33) 0) .cse9 .cse10 (= .cse12 .cse27)))))))))) [2023-02-18 03:57:21,906 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse38 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse37 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse41 (+ .cse38 1))) (let ((.cse39 (+ .cse41 1)) (.cse26 (+ .cse37 1))) (let ((.cse25 (+ .cse26 1)) (.cse40 (+ .cse39 1))) (let ((.cse21 (+ 0 1)) (.cse29 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse28 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (.cse17 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse34 (+ .cse40 1)) (.cse36 (+ .cse25 1))) (let ((.cse23 (< .cse41 |ULTIMATE.start_main_~k~0#1|)) (.cse5 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse11 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse31 (+ .cse36 1)) (.cse32 (< .cse34 |ULTIMATE.start_main_~k~0#1|)) (.cse30 (< .cse40 |ULTIMATE.start_main_~k~0#1|)) (.cse24 (< .cse39 |ULTIMATE.start_main_~k~0#1|)) (.cse22 (- .cse17)) (.cse19 (or .cse29 .cse28)) (.cse18 (= |ULTIMATE.start_main_~y~0#1| .cse21)) (.cse35 (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (.cse27 (< .cse38 |ULTIMATE.start_main_~k~0#1|))) (let ((.cse1 (+ 2 1)) (.cse3 (+ 1 1)) (.cse2 (+ (- 1) (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (.cse13 (< 0 |ULTIMATE.start_main_~k~0#1|)) (.cse8 (+ (+ 3 1) 1)) (.cse6 (or (= (+ (- (* .cse37 .cse37)) (* .cse37 |ULTIMATE.start_main_~k~0#1|)) 0) .cse35 .cse27)) (.cse0 (or (and (= (+ (+ (- (* (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| .cse17) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) .cse22) 0) .cse19) (and .cse19 .cse18 (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))))) (.cse7 (or .cse30 (not .cse24) (= (+ (- (* .cse36 .cse36)) (* .cse36 |ULTIMATE.start_main_~k~0#1|)) 0))) (.cse10 (or (= (let ((.cse33 (+ .cse31 1))) (+ (- (* .cse33 .cse33)) (* |ULTIMATE.start_main_~k~0#1| .cse33))) 0) (< (+ .cse34 1) |ULTIMATE.start_main_~k~0#1|) (not .cse32) .cse35)) (.cse12 (or (not .cse30) (= (+ (- (* .cse31 .cse31)) (* .cse31 |ULTIMATE.start_main_~k~0#1|)) 0) .cse32)) (.cse14 (or (and .cse28 (or (not .cse5) (not .cse11))) (and .cse29 .cse5 .cse11))) (.cse15 (or (= (+ (- (* .cse26 .cse26)) (* |ULTIMATE.start_main_~k~0#1| .cse26)) 0) .cse23 (not .cse27))) (.cse16 (or (not .cse23) .cse24 (= (+ (- (* .cse25 .cse25)) (* .cse25 |ULTIMATE.start_main_~k~0#1|)) 0)))) (or (and .cse0 (= .cse1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse1) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|)) (let ((.cse4 (+ .cse3 1))) (and (= .cse2 .cse3) .cse0 (<= |ULTIMATE.start_main_~k~0#1| 4) (< .cse4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse4 1)))) (let ((.cse9 (+ (+ .cse1 1) 1))) (and .cse5 .cse6 .cse0 .cse7 (<= |ULTIMATE.start_main_~k~0#1| 6) (= |ULTIMATE.start_main_~y~0#1| (+ .cse8 1)) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse9 1)) .cse10 (< .cse9 |ULTIMATE.start_main_~k~0#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (and (<= |ULTIMATE.start_main_~k~0#1| 2) .cse0 (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse3) (= .cse2 0)) (and (<= |ULTIMATE.start_main_~k~0#1| 1) .cse0 (= (mod (+ (* |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|) .cse17) 4) 0) .cse18 .cse13) (and (= |ULTIMATE.start_main_~y~0#1| 0) .cse19 (= |ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse20 (+ (+ (+ .cse21 1) 1) 1))) (and .cse0 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse20 1)) (<= |ULTIMATE.start_main_~k~0#1| 5) (< .cse20 |ULTIMATE.start_main_~k~0#1|) (= .cse8 |ULTIMATE.start_main_~y~0#1|))) (and .cse5 .cse6 .cse0 .cse7 .cse10 .cse11 .cse12 .cse14 .cse15 (= (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse22) 0) .cse16))))))))) [2023-02-18 03:57:21,906 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 03:57:21,906 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 40) the Hoare annotation is: true [2023-02-18 03:57:21,906 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-18 03:57:21,906 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-02-18 03:57:21,906 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 03:57:21,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 03:57:21,907 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse49 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse44 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse50 (+ .cse49 1))) (let ((.cse47 (+ .cse50 1)) (.cse42 (+ .cse44 1))) (let ((.cse41 (+ .cse42 1)) (.cse48 (+ .cse47 1)) (.cse27 (+ 0 1))) (let ((.cse2 (+ 2 1)) (.cse32 (+ .cse27 1)) (.cse22 (+ .cse48 1)) (.cse46 (+ .cse41 1)) (.cse36 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse33 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse35 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse34 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (.cse38 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse6 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse8 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse37 (- .cse38)) (.cse29 (or .cse35 .cse34)) (.cse26 (= |ULTIMATE.start_main_~y~0#1| .cse27)) (.cse28 (= 0 .cse33)) (.cse39 (< .cse50 |ULTIMATE.start_main_~k~0#1|)) (.cse24 (not .cse36)) (.cse43 (< .cse49 |ULTIMATE.start_main_~k~0#1|)) (.cse21 (+ .cse46 1)) (.cse23 (< .cse22 |ULTIMATE.start_main_~k~0#1|)) (.cse45 (< .cse48 |ULTIMATE.start_main_~k~0#1|)) (.cse40 (< .cse47 |ULTIMATE.start_main_~k~0#1|)) (.cse7 (+ 1 1)) (.cse4 (+ .cse32 1)) (.cse30 (+ .cse2 1)) (.cse31 (+ 3 1))) (let ((.cse19 (+ .cse31 1)) (.cse18 (+ .cse30 1)) (.cse17 (+ .cse4 1)) (.cse1 (+ .cse7 1)) (.cse14 (or .cse45 (not .cse40) (= (+ (- (* .cse46 .cse46)) (* .cse46 |ULTIMATE.start_main_~k~0#1|)) 0))) (.cse25 (or (not .cse45) (= (+ (- (* .cse21 .cse21)) (* .cse21 |ULTIMATE.start_main_~k~0#1|)) 0) .cse23)) (.cse13 (or (= (+ (- (* .cse44 .cse44)) (* .cse44 |ULTIMATE.start_main_~k~0#1|)) 0) .cse24 .cse43)) (.cse15 (or (= (+ (- (* .cse42 .cse42)) (* |ULTIMATE.start_main_~k~0#1| .cse42)) 0) .cse39 (not .cse43))) (.cse16 (or (not .cse39) .cse40 (= (+ (- (* .cse41 .cse41)) (* .cse41 |ULTIMATE.start_main_~k~0#1|)) 0))) (.cse3 (or (and (= (+ (+ (- (* (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| .cse38) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) .cse37) 0) .cse29) (and .cse29 .cse26 .cse28))) (.cse5 (or .cse36 (= (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse37) 0))) (.cse11 (+ (- 1) .cse8)) (.cse9 (< 0 |ULTIMATE.start_main_~k~0#1|)) (.cse10 (or (and .cse34 (or (not .cse0) (not .cse6))) (and .cse35 .cse0 .cse6))) (.cse12 (+ (- 1) |ULTIMATE.start_main_~c~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| .cse1) (= .cse2 |ULTIMATE.start_main_~c~0#1|) .cse3 (= .cse4 |ULTIMATE.start_main_~c~0#1|) (= .cse2 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse2) .cse5 .cse6 (= .cse7 .cse8) .cse9 (< 2 |ULTIMATE.start_main_~k~0#1|) .cse10 (= (+ (- 1) .cse11) 0) (<= 2 .cse12)) (and .cse0 .cse13 .cse3 .cse14 .cse5 (<= 7 .cse12) .cse6 .cse10 .cse15 .cse16) (and .cse0 (<= 4 .cse12) .cse3 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse17 1)) (= .cse18 |ULTIMATE.start_main_~c~0#1|) .cse5 (< .cse17 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse9 .cse10 (= .cse19 |ULTIMATE.start_main_~y~0#1|)) (and .cse0 (<= 5 .cse12) .cse13 .cse3 .cse14 (= |ULTIMATE.start_main_~y~0#1| (+ .cse19 1)) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse18 1)) (or (= (let ((.cse20 (+ .cse21 1))) (+ (- (* .cse20 .cse20)) (* |ULTIMATE.start_main_~k~0#1| .cse20))) 0) (< (+ .cse22 1) |ULTIMATE.start_main_~k~0#1|) (not .cse23) .cse24) (< .cse18 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse25 .cse9 .cse10 .cse15 .cse16) (and .cse0 (<= 0 .cse12) .cse3 (= .cse12 0) (= .cse8 0) .cse26 .cse6 (<= |ULTIMATE.start_main_~c~0#1| .cse27) .cse9 .cse10 .cse28 (= |ULTIMATE.start_main_~c~0#1| .cse27)) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse29 .cse6 .cse10 (= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse0 (<= 9 .cse12) .cse13 .cse3 .cse5 .cse6 .cse10 .cse15) (and .cse0 (= .cse11 .cse7) (= .cse17 |ULTIMATE.start_main_~c~0#1|) .cse3 (= |ULTIMATE.start_main_~c~0#1| .cse30) (= |ULTIMATE.start_main_~y~0#1| .cse31) (<= 3 .cse12) .cse5 .cse6 (< .cse1 |ULTIMATE.start_main_~k~0#1|) .cse9 .cse10 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse1 1))) (and .cse0 .cse13 .cse3 .cse14 (<= 6 .cse12) .cse5 .cse6 .cse25 .cse10 .cse15 .cse16) (and .cse0 .cse13 .cse3 .cse5 .cse6 .cse10 .cse15 (<= 8 .cse12) .cse16) (and .cse0 (= .cse7 |ULTIMATE.start_main_~y~0#1|) .cse3 (<= 1 .cse12) (= .cse7 |ULTIMATE.start_main_~c~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) .cse12) 0) (<= |ULTIMATE.start_main_~c~0#1| .cse7) .cse5 (= .cse11 0) (= .cse32 |ULTIMATE.start_main_~c~0#1|) .cse6 (= (+ (* (- 1) .cse8 .cse8 .cse8) .cse33) 0) .cse9 .cse10 (= .cse12 .cse27)))))))))) [2023-02-18 03:57:21,907 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2023-02-18 03:57:21,907 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-02-18 03:57:21,907 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse1 (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (or (and (= (let ((.cse0 (* |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|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| .cse0) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) (- .cse0))) 0) .cse1) (and .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ 0 1)) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| 0) .cse1 (= |ULTIMATE.start_main_~x~0#1| 0)))) [2023-02-18 03:57:21,907 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-18 03:57:21,908 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-18 03:57:21,908 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-18 03:57:21,908 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-18 03:57:21,908 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-18 03:57:21,908 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-18 03:57:21,910 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2023-02-18 03:57:21,911 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 03:57:21,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 03:57:21 BoogieIcfgContainer [2023-02-18 03:57:21,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 03:57:21,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 03:57:21,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 03:57:21,934 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 03:57:21,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:56:10" (3/4) ... [2023-02-18 03:57:21,936 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 03:57:21,940 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 03:57:21,942 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 03:57:21,942 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 03:57:21,942 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 03:57:21,942 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 03:57:21,962 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 03:57:21,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 03:57:21,962 INFO L158 Benchmark]: Toolchain (without parser) took 72089.08ms. Allocated memory is still 151.0MB. Free memory was 116.4MB in the beginning and 68.1MB in the end (delta: 48.3MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2023-02-18 03:57:21,963 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 03:57:21,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.91ms. Allocated memory is still 151.0MB. Free memory was 116.0MB in the beginning and 105.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 03:57:21,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.94ms. Allocated memory is still 151.0MB. Free memory was 105.9MB in the beginning and 104.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 03:57:21,963 INFO L158 Benchmark]: Boogie Preprocessor took 11.77ms. Allocated memory is still 151.0MB. Free memory was 104.5MB in the beginning and 103.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 03:57:21,963 INFO L158 Benchmark]: RCFGBuilder took 183.67ms. Allocated memory is still 151.0MB. Free memory was 103.4MB in the beginning and 93.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 03:57:21,964 INFO L158 Benchmark]: TraceAbstraction took 71703.16ms. Allocated memory is still 151.0MB. Free memory was 92.9MB in the beginning and 71.2MB in the end (delta: 21.7MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2023-02-18 03:57:21,964 INFO L158 Benchmark]: Witness Printer took 28.25ms. Allocated memory is still 151.0MB. Free memory was 71.2MB in the beginning and 68.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 03:57:21,965 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.91ms. Allocated memory is still 151.0MB. Free memory was 116.0MB in the beginning and 105.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.94ms. Allocated memory is still 151.0MB. Free memory was 105.9MB in the beginning and 104.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.77ms. Allocated memory is still 151.0MB. Free memory was 104.5MB in the beginning and 103.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 183.67ms. Allocated memory is still 151.0MB. Free memory was 103.4MB in the beginning and 93.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 71703.16ms. Allocated memory is still 151.0MB. Free memory was 92.9MB in the beginning and 71.2MB in the end (delta: 21.7MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 28.25ms. Allocated memory is still 151.0MB. Free memory was 71.2MB in the beginning and 68.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 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.6s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 928 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 21 IncrementalHoareTripleChecker+Unchecked, 730 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1439 IncrementalHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 198 mSDtfsCounter, 1439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 553 GetRequests, 372 SyntacticMatches, 7 SemanticMatches, 174 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 45.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=9, InterpolantAutomatonStates: 111, 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, 10 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 34 PreInvPairs, 68 NumberOfFragments, 5906 HoareAnnotationTreeSize, 34 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 61.4s InterpolantComputationTime, 386 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 3713 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1116 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 1025/1280 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: 27]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((k >= 0 && c == 1 + 1 + 1) && 2 + 1 == c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && 0 + 1 + 1 + 1 == c) && 2 + 1 == y) && c <= 2 + 1) && (c < k || k * y + -(y * y) == 0)) && k <= 10) && 1 + 1 == -1 + y) && 0 < k) && 2 < k) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && -1 + (-1 + (-1 + y)) == 0) && 2 <= -1 + c) || (((((((((k >= 0 && ((-((y + 1) * (y + 1)) + (y + 1) * k == 0 || !(c < k)) || c + 1 < k)) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && ((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 == 0)) && (c < k || k * y + -(y * y) == 0)) && 7 <= -1 + c) && k <= 10) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && ((-((y + 1 + 1) * (y + 1 + 1)) + k * (y + 1 + 1) == 0 || c + 1 + 1 < k) || !(c + 1 < k))) && ((!(c + 1 + 1 < k) || c + 1 + 1 + 1 < k) || -((y + 1 + 1 + 1) * (y + 1 + 1 + 1)) + (y + 1 + 1 + 1) * k == 0))) || ((((((((((k >= 0 && 4 <= -1 + c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && c <= 0 + 1 + 1 + 1 + 1 + 1) && 2 + 1 + 1 + 1 == c) && (c < k || k * y + -(y * y) == 0)) && 0 + 1 + 1 + 1 + 1 < k) && k <= 10) && 0 < k) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && 3 + 1 + 1 == y)) || ((((((((((((((k >= 0 && 5 <= -1 + c) && ((-((y + 1) * (y + 1)) + (y + 1) * k == 0 || !(c < k)) || c + 1 < k)) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && ((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 == 0)) && y == 3 + 1 + 1 + 1) && c <= 2 + 1 + 1 + 1 + 1) && (((-((y + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1)) + k * (y + 1 + 1 + 1 + 1 + 1 + 1) == 0 || c + 1 + 1 + 1 + 1 + 1 + 1 < k) || !(c + 1 + 1 + 1 + 1 + 1 < k)) || !(c < k))) && 2 + 1 + 1 + 1 < k) && k <= 10) && ((!(c + 1 + 1 + 1 + 1 < k) || -((y + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1)) + (y + 1 + 1 + 1 + 1 + 1) * k == 0) || c + 1 + 1 + 1 + 1 + 1 < k)) && 0 < k) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && ((-((y + 1 + 1) * (y + 1 + 1)) + k * (y + 1 + 1) == 0 || c + 1 + 1 < k) || !(c + 1 < k))) && ((!(c + 1 + 1 < k) || c + 1 + 1 + 1 < k) || -((y + 1 + 1 + 1) * (y + 1 + 1 + 1)) + (y + 1 + 1 + 1) * k == 0))) || (((((((((((k >= 0 && 0 <= -1 + c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + c == 0) && -1 + y == 0) && y == 0 + 1) && k <= 10) && c <= 0 + 1) && 0 < k) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && 0 == -1 * y * y * y + x) && c == 0 + 1)) || (((((((c == 0 && k >= 0) && y == 0) && c >= 0) && (cond == 1 || cond == 0)) && k <= 10) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && x == 0)) || (((((((k >= 0 && 9 <= -1 + c) && ((-((y + 1) * (y + 1)) + (y + 1) * k == 0 || !(c < k)) || c + 1 < k)) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && (c < k || k * y + -(y * y) == 0)) && k <= 10) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && ((-((y + 1 + 1) * (y + 1 + 1)) + k * (y + 1 + 1) == 0 || c + 1 + 1 < k) || !(c + 1 < k)))) || ((((((((((((k >= 0 && -1 + (-1 + y) == 1 + 1) && 0 + 1 + 1 + 1 + 1 == c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && c == 2 + 1 + 1) && y == 3 + 1) && 3 <= -1 + c) && (c < k || k * y + -(y * y) == 0)) && k <= 10) && 1 + 1 + 1 < k) && 0 < k) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && c <= 1 + 1 + 1 + 1)) || ((((((((((k >= 0 && ((-((y + 1) * (y + 1)) + (y + 1) * k == 0 || !(c < k)) || c + 1 < k)) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && ((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 == 0)) && 6 <= -1 + c) && (c < k || k * y + -(y * y) == 0)) && k <= 10) && ((!(c + 1 + 1 + 1 + 1 < k) || -((y + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1)) + (y + 1 + 1 + 1 + 1 + 1) * k == 0) || c + 1 + 1 + 1 + 1 + 1 < k)) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && ((-((y + 1 + 1) * (y + 1 + 1)) + k * (y + 1 + 1) == 0 || c + 1 + 1 < k) || !(c + 1 < k))) && ((!(c + 1 + 1 < k) || c + 1 + 1 + 1 < k) || -((y + 1 + 1 + 1) * (y + 1 + 1 + 1)) + (y + 1 + 1 + 1) * k == 0))) || ((((((((k >= 0 && ((-((y + 1) * (y + 1)) + (y + 1) * k == 0 || !(c < k)) || c + 1 < k)) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && (c < k || k * y + -(y * y) == 0)) && k <= 10) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && ((-((y + 1 + 1) * (y + 1 + 1)) + k * (y + 1 + 1) == 0 || c + 1 + 1 < k) || !(c + 1 < k))) && 8 <= -1 + c) && ((!(c + 1 + 1 < k) || c + 1 + 1 + 1 < k) || -((y + 1 + 1 + 1) * (y + 1 + 1 + 1)) + (y + 1 + 1 + 1) * k == 0))) || (((((((((((((((k >= 0 && 1 + 1 == y) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && 1 <= -1 + c) && 1 + 1 == c) && 1 < k) && -1 + (-1 + c) == 0) && c <= 1 + 1) && (c < k || k * y + -(y * y) == 0)) && -1 + (-1 + y) == 0) && 0 + 1 + 1 == c) && k <= 10) && -1 * (-1 + y) * (-1 + y) * (-1 + y) + (-1 * y * y * y + x) == 0) && 0 < k) && ((cond == 0 && (!(k >= 0) || !(k <= 10))) || ((cond == 1 && k >= 0) && k <= 10))) && -1 + c == 0 + 1) RESULT: Ultimate proved your program to be correct! [2023-02-18 03:57:21,987 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