./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 07:56:49,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 07:56:49,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 07:56:49,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 07:56:49,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 07:56:49,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 07:56:49,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 07:56:49,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 07:56:50,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 07:56:50,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 07:56:50,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 07:56:50,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 07:56:50,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 07:56:50,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 07:56:50,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 07:56:50,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 07:56:50,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 07:56:50,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 07:56:50,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 07:56:50,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 07:56:50,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 07:56:50,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 07:56:50,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 07:56:50,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 07:56:50,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 07:56:50,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 07:56:50,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 07:56:50,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 07:56:50,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 07:56:50,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 07:56:50,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 07:56:50,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 07:56:50,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 07:56:50,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 07:56:50,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 07:56:50,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 07:56:50,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 07:56:50,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 07:56:50,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 07:56:50,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 07:56:50,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 07:56:50,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 07:56:50,060 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 07:56:50,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 07:56:50,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 07:56:50,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 07:56:50,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 07:56:50,061 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 07:56:50,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 07:56:50,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 07:56:50,062 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 07:56:50,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 07:56:50,063 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 07:56:50,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 07:56:50,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 07:56:50,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 07:56:50,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 07:56:50,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 07:56:50,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 07:56:50,064 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 07:56:50,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 07:56:50,064 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 07:56:50,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 07:56:50,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 07:56:50,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 07:56:50,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 07:56:50,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:56:50,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 07:56:50,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 07:56:50,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 07:56:50,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 07:56:50,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 07:56:50,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 07:56:50,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 07:56:50,067 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 07:56:50,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 07:56:50,067 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 07:56:50,067 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b [2023-02-17 07:56:50,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 07:56:50,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 07:56:50,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 07:56:50,262 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 07:56:50,263 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 07:56:50,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2023-02-17 07:56:51,352 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 07:56:51,485 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 07:56:51,486 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2023-02-17 07:56:51,490 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea88b7c5f/f4655321cd9b40a99d6ccf0b34819f48/FLAG54b75e795 [2023-02-17 07:56:51,500 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea88b7c5f/f4655321cd9b40a99d6ccf0b34819f48 [2023-02-17 07:56:51,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 07:56:51,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 07:56:51,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 07:56:51,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 07:56:51,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 07:56:51,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f2475d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51, skipping insertion in model container [2023-02-17 07:56:51,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 07:56:51,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 07:56:51,631 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c[458,471] [2023-02-17 07:56:51,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:56:51,648 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 07:56:51,656 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c[458,471] [2023-02-17 07:56:51,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:56:51,669 INFO L208 MainTranslator]: Completed translation [2023-02-17 07:56:51,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51 WrapperNode [2023-02-17 07:56:51,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 07:56:51,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 07:56:51,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 07:56:51,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 07:56:51,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,691 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-02-17 07:56:51,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 07:56:51,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 07:56:51,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 07:56:51,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 07:56:51,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,709 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 07:56:51,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 07:56:51,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 07:56:51,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 07:56:51,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (1/1) ... [2023-02-17 07:56:51,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:56:51,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:56:51,736 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-17 07:56:51,752 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-17 07:56:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 07:56:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 07:56:51,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 07:56:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 07:56:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 07:56:51,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 07:56:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 07:56:51,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 07:56:51,820 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 07:56:51,822 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 07:56:51,945 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 07:56:51,972 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 07:56:51,972 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 07:56:51,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:56:51 BoogieIcfgContainer [2023-02-17 07:56:51,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 07:56:51,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 07:56:51,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 07:56:51,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 07:56:51,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 07:56:51" (1/3) ... [2023-02-17 07:56:51,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c54b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:56:51, skipping insertion in model container [2023-02-17 07:56:51,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:56:51" (2/3) ... [2023-02-17 07:56:51,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c54b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:56:51, skipping insertion in model container [2023-02-17 07:56:51,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:56:51" (3/3) ... [2023-02-17 07:56:51,983 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2023-02-17 07:56:51,996 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 07:56:51,996 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 07:56:52,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 07:56:52,052 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;@6d5fd0ff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 07:56:52,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 07:56:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 07:56:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 07:56:52,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:56:52,062 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:56:52,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:56:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:56:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2023-02-17 07:56:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:56:52,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545853375] [2023-02-17 07:56:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:56:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:56:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:56:52,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:56:52,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545853375] [2023-02-17 07:56:52,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 07:56:52,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619536421] [2023-02-17 07:56:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:56:52,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:56:52,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:56:52,188 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-17 07:56:52,213 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-17 07:56:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:56:52,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 07:56:52,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:56:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 07:56:52,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 07:56:52,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619536421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:56:52,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:56:52,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 07:56:52,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622436102] [2023-02-17 07:56:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:56:52,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 07:56:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:56:52,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 07:56:52,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 07:56:52,328 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 07:56:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:56:52,359 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-02-17 07:56:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 07:56:52,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-17 07:56:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:56:52,381 INFO L225 Difference]: With dead ends: 45 [2023-02-17 07:56:52,381 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 07:56:52,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 07:56:52,386 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 07:56:52,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 07:56:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 07:56:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-17 07:56:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 07:56:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-17 07:56:52,413 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2023-02-17 07:56:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:56:52,414 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-17 07:56:52,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 07:56:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-17 07:56:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 07:56:52,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:56:52,416 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:56:52,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 07:56:52,623 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-17 07:56:52,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:56:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:56:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2023-02-17 07:56:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:56:52,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176035275] [2023-02-17 07:56:52,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:56:52,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:56:52,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:56:52,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021310339] [2023-02-17 07:56:52,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:56:52,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:56:52,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:56:52,637 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-17 07:56:52,639 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-17 07:56:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:56:52,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 07:56:52,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:56:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 07:56:52,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 07:56:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:56:52,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176035275] [2023-02-17 07:56:52,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:56:52,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021310339] [2023-02-17 07:56:52,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021310339] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:56:52,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:56:52,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 07:56:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675559852] [2023-02-17 07:56:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:56:52,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 07:56:52,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:56:52,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 07:56:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 07:56:52,766 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 07:56:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:56:52,877 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-17 07:56:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 07:56:52,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-02-17 07:56:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:56:52,878 INFO L225 Difference]: With dead ends: 31 [2023-02-17 07:56:52,878 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 07:56:52,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-17 07:56:52,879 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:56:52,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:56:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 07:56:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 07:56:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 07:56:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-17 07:56:52,885 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2023-02-17 07:56:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:56:52,886 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-17 07:56:52,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 07:56:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-17 07:56:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 07:56:52,887 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:56:52,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:56:52,896 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-17 07:56:53,094 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-17 07:56:53,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:56:53,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:56:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2023-02-17 07:56:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:56:53,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769934966] [2023-02-17 07:56:53,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:56:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:56:53,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:56:53,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10128466] [2023-02-17 07:56:53,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:56:53,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:56:53,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:56:53,108 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-17 07:56:53,110 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-17 07:56:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:56:53,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 07:56:53,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:56:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 07:56:53,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:56:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 07:56:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:56:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769934966] [2023-02-17 07:56:53,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:56:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10128466] [2023-02-17 07:56:53,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10128466] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:56:53,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:56:53,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-17 07:56:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442760506] [2023-02-17 07:56:53,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:56:53,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 07:56:53,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:56:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 07:56:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-17 07:56:53,621 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 07:56:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:56:53,697 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-17 07:56:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 07:56:53,698 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-17 07:56:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:56:53,698 INFO L225 Difference]: With dead ends: 38 [2023-02-17 07:56:53,699 INFO L226 Difference]: Without dead ends: 34 [2023-02-17 07:56:53,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-17 07:56:53,700 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:56:53,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 89 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:56:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-17 07:56:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-02-17 07:56:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 07:56:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-17 07:56:53,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2023-02-17 07:56:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:56:53,706 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-17 07:56:53,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 07:56:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-17 07:56:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 07:56:53,707 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:56:53,707 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:56:53,714 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-17 07:56:53,912 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-17 07:56:53,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:56:53,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:56:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2023-02-17 07:56:53,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:56:53,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688219047] [2023-02-17 07:56:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:56:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:56:53,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:56:53,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916203695] [2023-02-17 07:56:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:56:53,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:56:53,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:56:53,923 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-17 07:56:53,925 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-17 07:56:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:56:53,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 07:56:53,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:56:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 07:56:54,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:56:56,046 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (* |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|) .cse0) (not (= (mod (+ .cse0 (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)))) is different from false [2023-02-17 07:57:02,232 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) .cse0) (= (mod (+ (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) .cse0) 12) 0))))) is different from true [2023-02-17 07:57:08,264 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) .cse0) (= (mod (+ (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) .cse0) 12) 0))))) is different from true [2023-02-17 07:57:22,104 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0))) is different from false [2023-02-17 07:57:22,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:57:22,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688219047] [2023-02-17 07:57:22,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:57:22,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916203695] [2023-02-17 07:57:22,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916203695] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:57:22,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:57:22,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-17 07:57:22,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948552728] [2023-02-17 07:57:22,112 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:57:22,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 07:57:22,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:57:22,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 07:57:22,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=105, Unknown=6, NotChecked=92, Total=240 [2023-02-17 07:57:22,114 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 07:57:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:57:22,196 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-02-17 07:57:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 07:57:22,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2023-02-17 07:57:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:57:22,198 INFO L225 Difference]: With dead ends: 38 [2023-02-17 07:57:22,198 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 07:57:22,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=56, Invalid=164, Unknown=6, NotChecked=116, Total=342 [2023-02-17 07:57:22,199 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:57:22,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 105 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:57:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 07:57:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-17 07:57:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 07:57:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-17 07:57:22,209 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-17 07:57:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:57:22,209 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-17 07:57:22,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 07:57:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-17 07:57:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 07:57:22,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:57:22,213 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:57:22,237 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-17 07:57:22,413 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-17 07:57:22,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:57:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:57:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2023-02-17 07:57:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:57:22,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429559883] [2023-02-17 07:57:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:57:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:57:22,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:57:22,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935006079] [2023-02-17 07:57:22,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:57:22,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:57:22,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:57:22,460 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-17 07:57:22,476 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-17 07:57:22,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:57:22,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:57:22,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 07:57:22,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:57:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-17 07:57:22,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:57:24,634 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |c_ULTIMATE.start_main_~k~0#1|) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)) (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (= (* |c_ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|))) is different from false [2023-02-17 07:57:28,675 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| Int)) (or (let ((.cse0 (+ 1 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|))) (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| .cse0) (* .cse0 .cse0))) (= (mod (+ (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|)) 12) 0)))) is different from true [2023-02-17 07:57:34,696 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| Int)) (or (let ((.cse0 (+ 1 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|))) (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| .cse0) (* .cse0 .cse0))) (= (mod (+ (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|)) 12) 0)))) is different from true [2023-02-17 07:57:38,737 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~c~0#1|))) (or (not (< .cse0 |ULTIMATE.start_main_~k~0#1|)) (let ((.cse1 (+ 1 (+ 1 |c_ULTIMATE.start_main_~y~0#1|)))) (= (* |ULTIMATE.start_main_~k~0#1| .cse1) (* .cse1 .cse1))) (< (+ .cse0 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-17 07:57:38,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:57:38,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429559883] [2023-02-17 07:57:38,746 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:57:38,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935006079] [2023-02-17 07:57:38,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935006079] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:57:38,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:57:38,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-17 07:57:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982650451] [2023-02-17 07:57:38,747 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:57:38,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 07:57:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:57:38,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 07:57:38,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=150, Unknown=4, NotChecked=108, Total=306 [2023-02-17 07:57:38,749 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 07:57:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:57:38,879 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-02-17 07:57:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 07:57:38,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2023-02-17 07:57:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:57:38,897 INFO L225 Difference]: With dead ends: 41 [2023-02-17 07:57:38,897 INFO L226 Difference]: Without dead ends: 35 [2023-02-17 07:57:38,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=63, Invalid=221, Unknown=4, NotChecked=132, Total=420 [2023-02-17 07:57:38,899 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:57:38,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 125 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:57:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-17 07:57:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-17 07:57:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 07:57:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-17 07:57:38,914 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2023-02-17 07:57:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:57:38,915 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-17 07:57:38,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 07:57:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-17 07:57:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-17 07:57:38,917 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:57:38,917 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:57:38,929 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-17 07:57:39,124 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-17 07:57:39,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:57:39,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:57:39,125 INFO L85 PathProgramCache]: Analyzing trace with hash 173594938, now seen corresponding path program 3 times [2023-02-17 07:57:39,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:57:39,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58194521] [2023-02-17 07:57:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:57:39,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:57:39,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:57:39,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828855572] [2023-02-17 07:57:39,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:57:39,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:57:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:57:39,151 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-17 07:57:39,153 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-17 07:57:39,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 07:57:39,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:57:39,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 07:57:39,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:57:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-17 07:57:39,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:57:41,390 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0))) is different from false [2023-02-17 07:57:41,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:57:41,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58194521] [2023-02-17 07:57:41,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:57:41,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828855572] [2023-02-17 07:57:41,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828855572] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:57:41,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:57:41,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-17 07:57:41,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261193933] [2023-02-17 07:57:41,393 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:57:41,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 07:57:41,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:57:41,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 07:57:41,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2023-02-17 07:57:41,394 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 07:57:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:57:41,528 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-02-17 07:57:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 07:57:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 50 [2023-02-17 07:57:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:57:41,529 INFO L225 Difference]: With dead ends: 44 [2023-02-17 07:57:41,529 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 07:57:41,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2023-02-17 07:57:41,530 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:57:41,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:57:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 07:57:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-17 07:57:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 07:57:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-17 07:57:41,536 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2023-02-17 07:57:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:57:41,536 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-17 07:57:41,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 07:57:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-17 07:57:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 07:57:41,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:57:41,537 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:57:41,545 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-17 07:57:41,743 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-17 07:57:41,743 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:57:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:57:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1013596503, now seen corresponding path program 4 times [2023-02-17 07:57:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:57:41,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901727729] [2023-02-17 07:57:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:57:41,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:57:41,752 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:57:41,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328081929] [2023-02-17 07:57:41,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 07:57:41,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:57:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:57:41,766 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-17 07:57:41,768 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-17 07:57:41,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 07:57:41,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:57:41,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 07:57:41,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:57:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-17 07:57:41,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:57:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-17 07:57:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:57:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901727729] [2023-02-17 07:57:42,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:57:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328081929] [2023-02-17 07:57:42,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328081929] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:57:42,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:57:42,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-02-17 07:57:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876856622] [2023-02-17 07:57:42,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:57:42,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 07:57:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:57:42,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 07:57:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-02-17 07:57:42,004 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-17 07:57:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:57:42,491 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2023-02-17 07:57:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 07:57:42,491 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 57 [2023-02-17 07:57:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:57:42,493 INFO L225 Difference]: With dead ends: 63 [2023-02-17 07:57:42,493 INFO L226 Difference]: Without dead ends: 55 [2023-02-17 07:57:42,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 07:57:42,495 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:57:42,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 258 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:57:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-17 07:57:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-02-17 07:57:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 07:57:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-02-17 07:57:42,517 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 57 [2023-02-17 07:57:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:57:42,519 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-02-17 07:57:42,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-17 07:57:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-02-17 07:57:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-17 07:57:42,523 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:57:42,523 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:57:42,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 07:57:42,731 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-17 07:57:42,731 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:57:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:57:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1063034534, now seen corresponding path program 5 times [2023-02-17 07:57:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:57:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270229894] [2023-02-17 07:57:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:57:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:57:42,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:57:42,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514812384] [2023-02-17 07:57:42,746 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 07:57:42,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:57:42,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:57:42,753 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-17 07:57:42,754 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-17 07:57:44,093 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-17 07:57:44,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:57:44,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-17 07:57:44,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:57:46,188 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~k~0#1| 9) (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0) (< 8 |c_ULTIMATE.start_main_~k~0#1|) (= |c_ULTIMATE.start_main_~y~0#1| (+ 1 (+ 1 7)))) is different from true [2023-02-17 07:57:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 51 proven. 136 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-02-17 07:57:46,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:57:48,244 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (* |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|) .cse0) (not (= (mod (+ .cse0 (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)))) is different from false [2023-02-17 07:57:52,266 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_36| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|) .cse0) (= (mod (+ (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|) .cse0 (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|)) 12) 0))))) is different from true [2023-02-17 07:57:58,331 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|) .cse0) (= (mod (+ (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|) .cse0 (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_52|)) 12) 0))))) is different from true [2023-02-17 07:58:10,598 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0))) is different from false [2023-02-17 07:58:10,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:10,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270229894] [2023-02-17 07:58:10,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:58:10,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514812384] [2023-02-17 07:58:10,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514812384] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:10,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:58:10,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2023-02-17 07:58:10,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980107540] [2023-02-17 07:58:10,606 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:10,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 07:58:10,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:10,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 07:58:10,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=338, Unknown=7, NotChecked=200, Total=600 [2023-02-17 07:58:10,607 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 13 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2023-02-17 07:58:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:11,011 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2023-02-17 07:58:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 07:58:11,012 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 13 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 92 [2023-02-17 07:58:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:11,015 INFO L225 Difference]: With dead ends: 62 [2023-02-17 07:58:11,015 INFO L226 Difference]: Without dead ends: 56 [2023-02-17 07:58:11,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=74, Invalid=445, Unknown=7, NotChecked=230, Total=756 [2023-02-17 07:58:11,016 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:11,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 316 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 574 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2023-02-17 07:58:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-17 07:58:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-17 07:58:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-17 07:58:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2023-02-17 07:58:11,041 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 92 [2023-02-17 07:58:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:11,041 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2023-02-17 07:58:11,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 13 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2023-02-17 07:58:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2023-02-17 07:58:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-17 07:58:11,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:11,045 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:11,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:11,252 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-17 07:58:11,253 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1524389175, now seen corresponding path program 6 times [2023-02-17 07:58:11,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:11,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431996243] [2023-02-17 07:58:11,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:11,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:11,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:58:11,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313909259] [2023-02-17 07:58:11,285 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 07:58:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:11,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:11,286 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-17 07:58:11,288 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-17 07:58:12,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-02-17 07:58:12,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:12,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-17 07:58:12,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-02-17 07:58:12,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-02-17 07:58:13,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:13,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431996243] [2023-02-17 07:58:13,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:58:13,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313909259] [2023-02-17 07:58:13,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313909259] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:13,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:58:13,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2023-02-17 07:58:13,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922496152] [2023-02-17 07:58:13,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:13,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-17 07:58:13,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:13,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-17 07:58:13,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2023-02-17 07:58:13,135 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 29 states have internal predecessors, (64), 25 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2023-02-17 07:58:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:13,688 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2023-02-17 07:58:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 07:58:13,690 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 29 states have internal predecessors, (64), 25 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) Word has length 99 [2023-02-17 07:58:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:13,690 INFO L225 Difference]: With dead ends: 69 [2023-02-17 07:58:13,690 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 07:58:13,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 07:58:13,695 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:13,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 07:58:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 07:58:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 07:58:13,698 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-17 07:58:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 07:58:13,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2023-02-17 07:58:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:13,698 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 07:58:13,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 29 states have internal predecessors, (64), 25 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2023-02-17 07:58:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 07:58:13,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 07:58:13,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 07:58:13,712 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-17 07:58:13,908 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-17 07:58:13,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 07:58:13,920 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 07:58:13,921 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse5 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) (let ((.cse32 (+ .cse5 (- 1))) (.cse48 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse49 (+ 1 .cse48)) (.cse13 (+ .cse32 (- 1)))) (let ((.cse2 (+ |ULTIMATE.start_main_~c~0#1| (- 1))) (.cse23 (+ .cse13 (- 1))) (.cse45 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse47 (+ 1 .cse49)) (.cse46 (+ 1 |ULTIMATE.start_main_~c~0#1|))) (let ((.cse25 (+ |ULTIMATE.start_main_~k~0#1| (- 1))) (.cse21 (+ 1 .cse46)) (.cse33 (= (* |ULTIMATE.start_main_~k~0#1| .cse47) (* .cse47 .cse47))) (.cse44 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse40 (= (* |ULTIMATE.start_main_~k~0#1| .cse49) (* .cse49 .cse49))) (.cse36 (= (* |ULTIMATE.start_main_~k~0#1| .cse48) (* .cse48 .cse48))) (.cse27 (+ |ULTIMATE.start_main_~c~0#1| 1)) (.cse35 (not .cse45)) (.cse1 (+ 1 0)) (.cse43 (+ .cse23 (- 1))) (.cse15 (+ 1 6)) (.cse41 (+ 1 .cse47)) (.cse42 (+ .cse2 (- 1)))) (let ((.cse17 (+ .cse42 (- 1))) (.cse7 (+ 1 7)) (.cse19 (= (* |ULTIMATE.start_main_~k~0#1| .cse41) (* .cse41 .cse41))) (.cse8 (+ 1 .cse15)) (.cse14 (+ .cse43 (- 1))) (.cse11 (+ 1 1)) (.cse12 (+ 1 .cse1)) (.cse18 (+ 1 3)) (.cse16 (or .cse36 (< .cse27 |ULTIMATE.start_main_~k~0#1|) .cse35)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse22 (or (not (< .cse46 |ULTIMATE.start_main_~k~0#1|)) .cse40 (< (+ .cse46 1) |ULTIMATE.start_main_~k~0#1|))) (.cse3 (or (= 0 (+ (+ (+ (+ (* (* (* (* (* (* (- 2) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse44) (* 12 |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| .cse1) (= |ULTIMATE.start_main_~x~0#1| (+ (* (* (* .cse44 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) 0))))) (.cse24 (or (not (< .cse21 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse21 1) |ULTIMATE.start_main_~k~0#1|) .cse33)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse9 (<= 3 .cse25)) (.cse6 (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse44) .cse45))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| .cse1) (<= 0 .cse2) .cse3 (<= |ULTIMATE.start_main_~c~0#1| .cse1) .cse4 (= .cse5 0) (= .cse2 0) .cse6 (< 0 |ULTIMATE.start_main_~k~0#1|) (< .cse2 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse7)) (= .cse5 .cse8) (<= 8 .cse2) .cse0 .cse3 .cse4 .cse9 (<= |ULTIMATE.start_main_~c~0#1| (+ 1 8)) (< 8 |ULTIMATE.start_main_~k~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~x~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse4 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (let ((.cse10 (+ 1 .cse11))) (and (<= 2 .cse2) (<= |ULTIMATE.start_main_~c~0#1| .cse10) (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse0 .cse3 (< .cse11 |ULTIMATE.start_main_~k~0#1|) (= .cse2 .cse12) .cse4 (= .cse13 0) .cse6)) (and (= (+ .cse14 (- 1)) 0) (= |ULTIMATE.start_main_~y~0#1| .cse15) .cse16 .cse0 .cse3 .cse4 .cse9 (<= 6 .cse2) .cse6 (= .cse17 .cse18)) (and (= (+ .cse17 (- 1)) .cse18) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse7) .cse3 (= |ULTIMATE.start_main_~y~0#1| .cse8) .cse4 .cse9 (<= 7 .cse2) .cse6) (and (let ((.cse20 (+ 1 .cse21))) (or .cse19 (not (< .cse20 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse20 1) |ULTIMATE.start_main_~k~0#1|))) (= |ULTIMATE.start_main_~y~0#1| .cse18) .cse0 .cse22 .cse3 .cse9 (< 3 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse18) .cse16 (<= 3 .cse2) (= .cse23 0) .cse24 .cse4 (<= |ULTIMATE.start_main_~c~0#1| .cse18)) (let ((.cse29 (+ 1 .cse41))) (let ((.cse26 (+ 1 .cse29))) (let ((.cse34 (+ 1 .cse26))) (let ((.cse37 (+ 1 .cse34))) (let ((.cse30 (< (+ |ULTIMATE.start_main_~k~0#1| (- 2)) .cse27)) (.cse31 (+ 1 .cse37)) (.cse28 (< (+ |ULTIMATE.start_main_~k~0#1| (- 3)) .cse27)) (.cse38 (< .cse25 .cse27))) (and (<= 9 .cse25) (or (= (* |ULTIMATE.start_main_~k~0#1| .cse26) (* .cse26 .cse26)) (< (+ |ULTIMATE.start_main_~k~0#1| (- 5)) .cse27)) .cse0 .cse3 (or .cse19 .cse28) .cse9 (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 4)) .cse27) (= (* |ULTIMATE.start_main_~k~0#1| .cse29) (* .cse29 .cse29))) (or .cse30 (< (+ |ULTIMATE.start_main_~k~0#1| (- 8)) .cse27) (= (* |ULTIMATE.start_main_~k~0#1| .cse31) (* .cse31 .cse31))) (= .cse32 .cse8) (or .cse30 .cse33) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 6)) .cse27) (= (* |ULTIMATE.start_main_~k~0#1| .cse34) (* .cse34 .cse34)) .cse35) (or .cse36 .cse35) .cse4 (or (= (* |ULTIMATE.start_main_~k~0#1| .cse37) (* .cse37 .cse37)) (< (+ |ULTIMATE.start_main_~k~0#1| (- 7)) .cse27) .cse38) (or (let ((.cse39 (+ 1 .cse31))) (= (* |ULTIMATE.start_main_~k~0#1| .cse39) (* .cse39 .cse39))) (< (+ |ULTIMATE.start_main_~k~0#1| (- 9)) .cse27) .cse28) (or .cse40 .cse38))))))) (and (= .cse14 0) (= .cse42 .cse18) .cse16 .cse0 .cse22 .cse3 (= .cse32 .cse18) .cse4 .cse9 .cse6 (<= 5 .cse2)) (and (<= 1 .cse2) (= |ULTIMATE.start_main_~y~0#1| .cse11) (<= |ULTIMATE.start_main_~c~0#1| .cse11) .cse0 .cse3 (= |ULTIMATE.start_main_~c~0#1| .cse11) .cse4 (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse12) .cse6 (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|) (= .cse32 0)) (and (= .cse2 .cse18) (= .cse5 .cse18) .cse16 .cse0 .cse22 (<= 4 .cse2) .cse3 .cse24 .cse4 .cse9 .cse6 (= .cse43 0))))))))) [2023-02-17 07:58:13,921 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-02-17 07:58:13,921 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-02-17 07:58:13,921 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~k~0#1| 0) (<= |ULTIMATE.start_main_~k~0#1| 10)) [2023-02-17 07:58:13,921 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 07:58:13,921 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 42) the Hoare annotation is: true [2023-02-17 07:58:13,922 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-02-17 07:58:13,922 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 07:58:13,922 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 07:58:13,922 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse5 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) (let ((.cse32 (+ .cse5 (- 1))) (.cse48 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse49 (+ 1 .cse48)) (.cse13 (+ .cse32 (- 1)))) (let ((.cse2 (+ |ULTIMATE.start_main_~c~0#1| (- 1))) (.cse23 (+ .cse13 (- 1))) (.cse45 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse47 (+ 1 .cse49)) (.cse46 (+ 1 |ULTIMATE.start_main_~c~0#1|))) (let ((.cse25 (+ |ULTIMATE.start_main_~k~0#1| (- 1))) (.cse21 (+ 1 .cse46)) (.cse33 (= (* |ULTIMATE.start_main_~k~0#1| .cse47) (* .cse47 .cse47))) (.cse44 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse40 (= (* |ULTIMATE.start_main_~k~0#1| .cse49) (* .cse49 .cse49))) (.cse36 (= (* |ULTIMATE.start_main_~k~0#1| .cse48) (* .cse48 .cse48))) (.cse27 (+ |ULTIMATE.start_main_~c~0#1| 1)) (.cse35 (not .cse45)) (.cse1 (+ 1 0)) (.cse43 (+ .cse23 (- 1))) (.cse15 (+ 1 6)) (.cse41 (+ 1 .cse47)) (.cse42 (+ .cse2 (- 1)))) (let ((.cse17 (+ .cse42 (- 1))) (.cse7 (+ 1 7)) (.cse19 (= (* |ULTIMATE.start_main_~k~0#1| .cse41) (* .cse41 .cse41))) (.cse8 (+ 1 .cse15)) (.cse14 (+ .cse43 (- 1))) (.cse11 (+ 1 1)) (.cse12 (+ 1 .cse1)) (.cse18 (+ 1 3)) (.cse16 (or .cse36 (< .cse27 |ULTIMATE.start_main_~k~0#1|) .cse35)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse22 (or (not (< .cse46 |ULTIMATE.start_main_~k~0#1|)) .cse40 (< (+ .cse46 1) |ULTIMATE.start_main_~k~0#1|))) (.cse3 (or (= 0 (+ (+ (+ (+ (* (* (* (* (* (* (- 2) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse44) (* 12 |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| .cse1) (= |ULTIMATE.start_main_~x~0#1| (+ (* (* (* .cse44 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) 0))))) (.cse24 (or (not (< .cse21 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse21 1) |ULTIMATE.start_main_~k~0#1|) .cse33)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse9 (<= 3 .cse25)) (.cse6 (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse44) .cse45))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| .cse1) (<= 0 .cse2) .cse3 (<= |ULTIMATE.start_main_~c~0#1| .cse1) .cse4 (= .cse5 0) (= .cse2 0) .cse6 (< 0 |ULTIMATE.start_main_~k~0#1|) (< .cse2 |ULTIMATE.start_main_~k~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~x~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse4 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse7)) (= .cse5 .cse8) (<= 8 .cse2) .cse0 .cse3 .cse4 .cse9 (<= |ULTIMATE.start_main_~c~0#1| (+ 1 8)) (< 8 |ULTIMATE.start_main_~k~0#1|)) (let ((.cse10 (+ 1 .cse11))) (and (<= 2 .cse2) (<= |ULTIMATE.start_main_~c~0#1| .cse10) (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse0 .cse3 (< .cse11 |ULTIMATE.start_main_~k~0#1|) (= .cse2 .cse12) .cse4 (= .cse13 0) .cse6)) (and (= (+ .cse14 (- 1)) 0) (= |ULTIMATE.start_main_~y~0#1| .cse15) .cse16 .cse0 .cse3 .cse4 .cse9 (<= 6 .cse2) .cse6 (= .cse17 .cse18)) (and (let ((.cse20 (+ 1 .cse21))) (or .cse19 (not (< .cse20 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse20 1) |ULTIMATE.start_main_~k~0#1|))) (= |ULTIMATE.start_main_~y~0#1| .cse18) .cse0 .cse22 .cse3 .cse9 (< 3 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse18) .cse16 (<= 3 .cse2) (= .cse23 0) .cse24 .cse4 (<= |ULTIMATE.start_main_~c~0#1| .cse18)) (and (= (+ .cse17 (- 1)) .cse18) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse7) .cse3 (= |ULTIMATE.start_main_~y~0#1| .cse8) .cse4 .cse9 (<= 7 .cse2) .cse6) (let ((.cse29 (+ 1 .cse41))) (let ((.cse26 (+ 1 .cse29))) (let ((.cse34 (+ 1 .cse26))) (let ((.cse37 (+ 1 .cse34))) (let ((.cse30 (< (+ |ULTIMATE.start_main_~k~0#1| (- 2)) .cse27)) (.cse31 (+ 1 .cse37)) (.cse28 (< (+ |ULTIMATE.start_main_~k~0#1| (- 3)) .cse27)) (.cse38 (< .cse25 .cse27))) (and (<= 9 .cse25) (or (= (* |ULTIMATE.start_main_~k~0#1| .cse26) (* .cse26 .cse26)) (< (+ |ULTIMATE.start_main_~k~0#1| (- 5)) .cse27)) .cse0 .cse3 (or .cse19 .cse28) .cse9 (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 4)) .cse27) (= (* |ULTIMATE.start_main_~k~0#1| .cse29) (* .cse29 .cse29))) (or .cse30 (< (+ |ULTIMATE.start_main_~k~0#1| (- 8)) .cse27) (= (* |ULTIMATE.start_main_~k~0#1| .cse31) (* .cse31 .cse31))) (= .cse32 .cse8) (or .cse30 .cse33) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 6)) .cse27) (= (* |ULTIMATE.start_main_~k~0#1| .cse34) (* .cse34 .cse34)) .cse35) (or .cse36 .cse35) .cse4 (or (= (* |ULTIMATE.start_main_~k~0#1| .cse37) (* .cse37 .cse37)) (< (+ |ULTIMATE.start_main_~k~0#1| (- 7)) .cse27) .cse38) (or (let ((.cse39 (+ 1 .cse31))) (= (* |ULTIMATE.start_main_~k~0#1| .cse39) (* .cse39 .cse39))) (< (+ |ULTIMATE.start_main_~k~0#1| (- 9)) .cse27) .cse28) (or .cse40 .cse38))))))) (and (= .cse14 0) (= .cse42 .cse18) .cse16 .cse0 .cse22 .cse3 (= .cse32 .cse18) .cse4 .cse9 .cse6 (<= 5 .cse2)) (and (<= 1 .cse2) (= |ULTIMATE.start_main_~y~0#1| .cse11) (<= |ULTIMATE.start_main_~c~0#1| .cse11) .cse0 .cse3 (= |ULTIMATE.start_main_~c~0#1| .cse11) .cse4 (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse12) .cse6 (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|) (= .cse32 0)) (and (= .cse2 .cse18) (= .cse5 .cse18) .cse16 .cse0 .cse22 (<= 4 .cse2) .cse3 .cse24 .cse4 .cse9 .cse6 (= .cse43 0))))))))) [2023-02-17 07:58:13,923 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse34 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse33 (+ 1 .cse34))) (let ((.cse35 (+ 1 .cse33))) (let ((.cse31 (+ 1 |ULTIMATE.start_main_~c~0#1|)) (.cse29 (+ 1 .cse35))) (let ((.cse21 (= (* |ULTIMATE.start_main_~k~0#1| .cse35) (* .cse35 .cse35))) (.cse24 (= (* |ULTIMATE.start_main_~k~0#1| .cse34) (* .cse34 .cse34))) (.cse15 (+ |ULTIMATE.start_main_~c~0#1| 1)) (.cse23 (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (.cse9 (+ 1 0)) (.cse11 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse28 (= (* |ULTIMATE.start_main_~k~0#1| .cse33) (* .cse33 .cse33))) (.cse16 (= (* |ULTIMATE.start_main_~k~0#1| .cse29) (* .cse29 .cse29))) (.cse30 (+ 1 .cse31))) (let ((.cse8 (+ 1 1)) (.cse0 (let ((.cse32 (+ 1 .cse30))) (or .cse16 (not (< .cse32 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse32 1) |ULTIMATE.start_main_~k~0#1|)))) (.cse2 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse3 (or (not (< .cse31 |ULTIMATE.start_main_~k~0#1|)) .cse28 (< (+ .cse31 1) |ULTIMATE.start_main_~k~0#1|))) (.cse4 (or (= 0 (+ (+ (+ (+ (* (* (* (* (* (* (- 2) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse11) (* 12 |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| .cse9) (= |ULTIMATE.start_main_~x~0#1| (+ (* (* (* .cse11 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) 0))))) (.cse10 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse1 (or .cse24 (< .cse15 |ULTIMATE.start_main_~k~0#1|) .cse23)) (.cse5 (or (not (< .cse30 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse30 1) |ULTIMATE.start_main_~k~0#1|) .cse21)) (.cse6 (<= |ULTIMATE.start_main_~k~0#1| 10))) (or (and (= |ULTIMATE.start_main_~y~0#1| (+ 1 (+ 1 7))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~k~0#1| 9) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 8)) (< 8 |ULTIMATE.start_main_~k~0#1|)) (let ((.cse7 (+ 1 .cse8))) (and (<= |ULTIMATE.start_main_~c~0#1| .cse7) (= |ULTIMATE.start_main_~y~0#1| .cse7) .cse4 (<= |ULTIMATE.start_main_~k~0#1| 3) (< .cse8 |ULTIMATE.start_main_~k~0#1|))) (and .cse4 (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| .cse9) (= .cse10 0) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and .cse0 (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse11) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse12 (+ 1 3))) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse12) .cse2 .cse1 .cse3 .cse4 (<= |ULTIMATE.start_main_~k~0#1| 4) .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| .cse12) (< 3 |ULTIMATE.start_main_~k~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| .cse8) (<= |ULTIMATE.start_main_~c~0#1| .cse8) .cse4 (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|)) (let ((.cse18 (+ 1 .cse29))) (let ((.cse14 (+ 1 .cse18))) (let ((.cse22 (+ 1 .cse14))) (let ((.cse13 (+ |ULTIMATE.start_main_~k~0#1| (- 1))) (.cse25 (+ 1 .cse22))) (let ((.cse19 (< (+ |ULTIMATE.start_main_~k~0#1| (- 2)) .cse15)) (.cse20 (+ 1 .cse25)) (.cse17 (< (+ |ULTIMATE.start_main_~k~0#1| (- 3)) .cse15)) (.cse26 (< .cse13 .cse15))) (and .cse0 (<= 9 .cse13) (or (= (* |ULTIMATE.start_main_~k~0#1| .cse14) (* .cse14 .cse14)) (< (+ |ULTIMATE.start_main_~k~0#1| (- 5)) .cse15)) .cse2 .cse3 .cse4 (or .cse16 .cse17) (<= 3 .cse13) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 4)) .cse15) (= (* |ULTIMATE.start_main_~k~0#1| .cse18) (* .cse18 .cse18))) (or .cse19 (< (+ |ULTIMATE.start_main_~k~0#1| (- 8)) .cse15) (= (* |ULTIMATE.start_main_~k~0#1| .cse20) (* .cse20 .cse20))) (= (+ .cse10 (- 1)) (+ 1 (+ 1 6))) (or .cse19 .cse21) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 6)) .cse15) (= (* |ULTIMATE.start_main_~k~0#1| .cse22) (* .cse22 .cse22)) .cse23) .cse1 (or .cse24 .cse23) .cse5 .cse6 (or (= (* |ULTIMATE.start_main_~k~0#1| .cse25) (* .cse25 .cse25)) (< (+ |ULTIMATE.start_main_~k~0#1| (- 7)) .cse15) .cse26) (or (let ((.cse27 (+ 1 .cse20))) (= (* |ULTIMATE.start_main_~k~0#1| .cse27) (* .cse27 .cse27))) (< (+ |ULTIMATE.start_main_~k~0#1| (- 9)) .cse15) .cse17) (or .cse28 .cse26)))))))))))))) [2023-02-17 07:58:13,923 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-02-17 07:58:13,923 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse34 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse33 (+ 1 .cse34))) (let ((.cse35 (+ 1 .cse33))) (let ((.cse31 (+ 1 |ULTIMATE.start_main_~c~0#1|)) (.cse29 (+ 1 .cse35))) (let ((.cse21 (= (* |ULTIMATE.start_main_~k~0#1| .cse35) (* .cse35 .cse35))) (.cse24 (= (* |ULTIMATE.start_main_~k~0#1| .cse34) (* .cse34 .cse34))) (.cse15 (+ |ULTIMATE.start_main_~c~0#1| 1)) (.cse23 (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (.cse9 (+ 1 0)) (.cse11 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse28 (= (* |ULTIMATE.start_main_~k~0#1| .cse33) (* .cse33 .cse33))) (.cse16 (= (* |ULTIMATE.start_main_~k~0#1| .cse29) (* .cse29 .cse29))) (.cse30 (+ 1 .cse31))) (let ((.cse8 (+ 1 1)) (.cse0 (let ((.cse32 (+ 1 .cse30))) (or .cse16 (not (< .cse32 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse32 1) |ULTIMATE.start_main_~k~0#1|)))) (.cse2 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse3 (or (not (< .cse31 |ULTIMATE.start_main_~k~0#1|)) .cse28 (< (+ .cse31 1) |ULTIMATE.start_main_~k~0#1|))) (.cse4 (or (= 0 (+ (+ (+ (+ (* (* (* (* (* (* (- 2) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse11) (* 12 |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| .cse9) (= |ULTIMATE.start_main_~x~0#1| (+ (* (* (* .cse11 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) 0))))) (.cse10 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse1 (or .cse24 (< .cse15 |ULTIMATE.start_main_~k~0#1|) .cse23)) (.cse5 (or (not (< .cse30 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse30 1) |ULTIMATE.start_main_~k~0#1|) .cse21)) (.cse6 (<= |ULTIMATE.start_main_~k~0#1| 10))) (or (and (= |ULTIMATE.start_main_~y~0#1| (+ 1 (+ 1 7))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~k~0#1| 9) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 8)) (< 8 |ULTIMATE.start_main_~k~0#1|)) (let ((.cse7 (+ 1 .cse8))) (and (<= |ULTIMATE.start_main_~c~0#1| .cse7) (= |ULTIMATE.start_main_~y~0#1| .cse7) .cse4 (<= |ULTIMATE.start_main_~k~0#1| 3) (< .cse8 |ULTIMATE.start_main_~k~0#1|))) (and .cse4 (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| .cse9) (= .cse10 0) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and .cse0 (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse11) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse12 (+ 1 3))) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse12) .cse2 .cse1 .cse3 .cse4 (<= |ULTIMATE.start_main_~k~0#1| 4) .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| .cse12) (< 3 |ULTIMATE.start_main_~k~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| .cse8) (<= |ULTIMATE.start_main_~c~0#1| .cse8) .cse4 (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|)) (let ((.cse18 (+ 1 .cse29))) (let ((.cse14 (+ 1 .cse18))) (let ((.cse22 (+ 1 .cse14))) (let ((.cse13 (+ |ULTIMATE.start_main_~k~0#1| (- 1))) (.cse25 (+ 1 .cse22))) (let ((.cse19 (< (+ |ULTIMATE.start_main_~k~0#1| (- 2)) .cse15)) (.cse20 (+ 1 .cse25)) (.cse17 (< (+ |ULTIMATE.start_main_~k~0#1| (- 3)) .cse15)) (.cse26 (< .cse13 .cse15))) (and .cse0 (<= 9 .cse13) (or (= (* |ULTIMATE.start_main_~k~0#1| .cse14) (* .cse14 .cse14)) (< (+ |ULTIMATE.start_main_~k~0#1| (- 5)) .cse15)) .cse2 .cse3 .cse4 (or .cse16 .cse17) (<= 3 .cse13) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 4)) .cse15) (= (* |ULTIMATE.start_main_~k~0#1| .cse18) (* .cse18 .cse18))) (or .cse19 (< (+ |ULTIMATE.start_main_~k~0#1| (- 8)) .cse15) (= (* |ULTIMATE.start_main_~k~0#1| .cse20) (* .cse20 .cse20))) (= (+ .cse10 (- 1)) (+ 1 (+ 1 6))) (or .cse19 .cse21) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 6)) .cse15) (= (* |ULTIMATE.start_main_~k~0#1| .cse22) (* .cse22 .cse22)) .cse23) .cse1 (or .cse24 .cse23) .cse5 .cse6 (or (= (* |ULTIMATE.start_main_~k~0#1| .cse25) (* .cse25 .cse25)) (< (+ |ULTIMATE.start_main_~k~0#1| (- 7)) .cse15) .cse26) (or (let ((.cse27 (+ 1 .cse20))) (= (* |ULTIMATE.start_main_~k~0#1| .cse27) (* .cse27 .cse27))) (< (+ |ULTIMATE.start_main_~k~0#1| (- 9)) .cse15) .cse17) (or .cse28 .cse26)))))))))))))) [2023-02-17 07:58:13,923 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-02-17 07:58:13,923 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-17 07:58:13,923 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-02-17 07:58:13,924 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-02-17 07:58:13,924 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-17 07:58:13,924 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-17 07:58:13,924 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-17 07:58:13,924 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-17 07:58:13,924 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-17 07:58:13,924 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-17 07:58:13,926 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2023-02-17 07:58:13,928 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 07:58:13,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 07:58:13 BoogieIcfgContainer [2023-02-17 07:58:13,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 07:58:13,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 07:58:13,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 07:58:13,963 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 07:58:13,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:56:51" (3/4) ... [2023-02-17 07:58:13,965 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 07:58:13,969 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-17 07:58:13,969 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 07:58:13,971 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-17 07:58:13,971 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 07:58:13,972 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 07:58:13,972 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 07:58:14,008 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 07:58:14,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 07:58:14,008 INFO L158 Benchmark]: Toolchain (without parser) took 82505.92ms. Allocated memory is still 209.7MB. Free memory was 162.7MB in the beginning and 145.5MB in the end (delta: 17.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2023-02-17 07:58:14,009 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:58:14,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.55ms. Allocated memory is still 209.7MB. Free memory was 162.1MB in the beginning and 151.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:58:14,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.87ms. Allocated memory is still 209.7MB. Free memory was 151.6MB in the beginning and 150.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:58:14,009 INFO L158 Benchmark]: Boogie Preprocessor took 19.03ms. Allocated memory is still 209.7MB. Free memory was 150.2MB in the beginning and 149.5MB in the end (delta: 677.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:58:14,009 INFO L158 Benchmark]: RCFGBuilder took 262.78ms. Allocated memory is still 209.7MB. Free memory was 148.8MB in the beginning and 139.0MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:58:14,010 INFO L158 Benchmark]: TraceAbstraction took 81985.92ms. Allocated memory is still 209.7MB. Free memory was 138.3MB in the beginning and 147.6MB in the end (delta: -9.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:58:14,010 INFO L158 Benchmark]: Witness Printer took 45.58ms. Allocated memory is still 209.7MB. Free memory was 147.6MB in the beginning and 145.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:58:14,011 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 134.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.55ms. Allocated memory is still 209.7MB. Free memory was 162.1MB in the beginning and 151.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.87ms. Allocated memory is still 209.7MB. Free memory was 151.6MB in the beginning and 150.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.03ms. Allocated memory is still 209.7MB. Free memory was 150.2MB in the beginning and 149.5MB in the end (delta: 677.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 262.78ms. Allocated memory is still 209.7MB. Free memory was 148.8MB in the beginning and 139.0MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 81985.92ms. Allocated memory is still 209.7MB. Free memory was 138.3MB in the beginning and 147.6MB in the end (delta: -9.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 45.58ms. Allocated memory is still 209.7MB. Free memory was 147.6MB in the beginning and 145.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 81.9s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 1543 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 62 IncrementalHoareTripleChecker+Unchecked, 1299 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2275 IncrementalHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 244 mSDtfsCounter, 2275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 544 SyntacticMatches, 12 SemanticMatches, 163 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 49.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, InterpolantAutomatonStates: 106, 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, 9 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 43 PreInvPairs, 83 NumberOfFragments, 7565 HoareAnnotationTreeSize, 43 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 74.3s InterpolantComputationTime, 456 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 5224 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1120 ConjunctsInSsa, 237 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1089/1673 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((((((((((((((k >= 0 && c == 1 + 0) && 0 <= c + -1) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && c <= 1 + 0) && k <= 10) && y + -1 == 0) && c + -1 == 0) && (k * y == y * y || c < k)) && 0 < k) && c + -1 < k) || (((((k >= 0 && x == 0) && c >= 0) && k <= 10) && y == 0) && c == 0)) || ((((((((y == 1 + (1 + 7) && y + -1 == 1 + (1 + 6)) && 8 <= c + -1) && k >= 0) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && k <= 10) && 3 <= k + -1) && c <= 1 + 8) && 8 < k)) || (((((((((2 <= c + -1 && c <= 1 + (1 + 1)) && y == 1 + (1 + 1)) && k >= 0) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && 1 + 1 < k) && c + -1 == 1 + (1 + 0)) && k <= 10) && y + -1 + -1 + -1 == 0) && (k * y == y * y || c < k))) || (((((((((y + -1 + -1 + -1 + -1 + -1 + -1 + -1 == 0 && y == 1 + 6) && ((k * (1 + y) == (1 + y) * (1 + y) || c + 1 < k) || !(c < k))) && k >= 0) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && k <= 10) && 3 <= k + -1) && 6 <= c + -1) && (k * y == y * y || c < k)) && c + -1 + -1 + -1 == 1 + 3)) || (((((((((((((((k * (1 + (1 + (1 + (1 + y)))) == (1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y)))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k) && y == 1 + 3) && k >= 0) && ((!(1 + c < k) || k * (1 + (1 + y)) == (1 + (1 + y)) * (1 + (1 + y))) || 1 + c + 1 < k)) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && 3 <= k + -1) && 3 < k) && c == 1 + 3) && ((k * (1 + y) == (1 + y) * (1 + y) || c + 1 < k) || !(c < k))) && 3 <= c + -1) && y + -1 + -1 + -1 + -1 == 0) && ((!(1 + (1 + c) < k) || 1 + (1 + c) + 1 < k) || k * (1 + (1 + (1 + y))) == (1 + (1 + (1 + y))) * (1 + (1 + (1 + y))))) && k <= 10) && c <= 1 + 3)) || ((((((((c + -1 + -1 + -1 + -1 == 1 + 3 && k >= 0) && y == 1 + 7) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && y == 1 + (1 + 6)) && k <= 10) && 3 <= k + -1) && 7 <= c + -1) && (k * y == y * y || c < k))) || (((((((((((((((9 <= k + -1 && (k * (1 + (1 + (1 + (1 + (1 + (1 + y)))))) == (1 + (1 + (1 + (1 + (1 + (1 + y)))))) * (1 + (1 + (1 + (1 + (1 + (1 + y)))))) || k + -5 < c + 1)) && k >= 0) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && (k * (1 + (1 + (1 + (1 + y)))) == (1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y)))) || k + -3 < c + 1)) && 3 <= k + -1) && (k + -4 < c + 1 || k * (1 + (1 + (1 + (1 + (1 + y))))) == (1 + (1 + (1 + (1 + (1 + y))))) * (1 + (1 + (1 + (1 + (1 + y))))))) && ((k + -2 < c + 1 || k + -8 < c + 1) || k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) == (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))))) && y + -1 + -1 == 1 + (1 + 6)) && (k + -2 < c + 1 || k * (1 + (1 + (1 + y))) == (1 + (1 + (1 + y))) * (1 + (1 + (1 + y))))) && ((k + -6 < c + 1 || k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) == (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) || !(c < k))) && (k * (1 + y) == (1 + y) * (1 + y) || !(c < k))) && k <= 10) && ((k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) == (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) || k + -7 < c + 1) || k + -1 < c + 1)) && ((k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) == (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) || k + -9 < c + 1) || k + -3 < c + 1)) && (k * (1 + (1 + y)) == (1 + (1 + y)) * (1 + (1 + y)) || k + -1 < c + 1))) || ((((((((((y + -1 + -1 + -1 + -1 + -1 + -1 == 0 && c + -1 + -1 == 1 + 3) && ((k * (1 + y) == (1 + y) * (1 + y) || c + 1 < k) || !(c < k))) && k >= 0) && ((!(1 + c < k) || k * (1 + (1 + y)) == (1 + (1 + y)) * (1 + (1 + y))) || 1 + c + 1 < k)) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && y + -1 + -1 == 1 + 3) && k <= 10) && 3 <= k + -1) && (k * y == y * y || c < k)) && 5 <= c + -1)) || (((((((((((1 <= c + -1 && y == 1 + 1) && c <= 1 + 1) && k >= 0) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && c == 1 + 1) && k <= 10) && 1 < k) && c == 1 + (1 + 0)) && (k * y == y * y || c < k)) && 1 + -1 < k) && y + -1 + -1 == 0)) || (((((((((((c + -1 == 1 + 3 && y + -1 == 1 + 3) && ((k * (1 + y) == (1 + y) * (1 + y) || c + 1 < k) || !(c < k))) && k >= 0) && ((!(1 + c < k) || k * (1 + (1 + y)) == (1 + (1 + y)) * (1 + (1 + y))) || 1 + c + 1 < k)) && 4 <= c + -1) && (0 == -2 * y * y * y * y * y * y + -(6 * y * y * y * y * y) + -(5 * y * y * y * y) + y * y + 12 * x || (y == 1 + 0 && x == y * y * y * y * y + 0))) && ((!(1 + (1 + c) < k) || 1 + (1 + c) + 1 < k) || k * (1 + (1 + (1 + y))) == (1 + (1 + (1 + y))) * (1 + (1 + (1 + y))))) && k <= 10) && 3 <= k + -1) && (k * y == y * y || c < k)) && y + -1 + -1 + -1 + -1 + -1 == 0) RESULT: Ultimate proved your program to be correct! [2023-02-17 07:58:14,052 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