./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 b5317dae 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-?-b5317da-m [2023-02-16 02:51:42,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 02:51:42,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 02:51:42,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 02:51:42,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 02:51:42,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 02:51:42,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 02:51:42,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 02:51:42,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 02:51:42,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 02:51:42,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 02:51:42,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 02:51:42,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 02:51:42,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 02:51:42,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 02:51:42,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 02:51:42,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 02:51:42,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 02:51:42,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 02:51:42,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 02:51:42,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 02:51:42,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 02:51:42,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 02:51:42,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 02:51:42,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 02:51:42,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 02:51:42,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 02:51:42,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 02:51:42,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 02:51:42,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 02:51:42,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 02:51:42,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 02:51:42,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 02:51:42,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 02:51:42,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 02:51:42,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 02:51:42,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 02:51:42,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 02:51:42,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 02:51:42,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 02:51:42,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 02:51:42,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 02:51:42,498 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 02:51:42,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 02:51:42,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 02:51:42,500 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 02:51:42,500 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 02:51:42,501 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 02:51:42,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 02:51:42,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 02:51:42,501 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 02:51:42,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 02:51:42,503 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 02:51:42,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 02:51:42,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 02:51:42,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 02:51:42,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 02:51:42,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 02:51:42,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 02:51:42,504 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 02:51:42,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 02:51:42,505 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 02:51:42,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 02:51:42,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 02:51:42,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 02:51:42,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 02:51:42,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:51:42,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 02:51:42,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 02:51:42,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 02:51:42,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 02:51:42,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 02:51:42,511 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 02:51:42,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 02:51:42,512 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 02:51:42,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 02:51:42,512 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 02:51:42,512 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-16 02:51:42,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 02:51:42,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 02:51:42,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 02:51:42,743 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 02:51:42,744 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 02:51:42,745 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-16 02:51:43,792 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 02:51:43,975 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 02:51:43,976 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2023-02-16 02:51:43,980 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255ccb904/03e11b85ce9641268b7bd147625175ae/FLAG3ebf8b5e3 [2023-02-16 02:51:43,990 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255ccb904/03e11b85ce9641268b7bd147625175ae [2023-02-16 02:51:43,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 02:51:43,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 02:51:43,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 02:51:43,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 02:51:43,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 02:51:43,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:51:43" (1/1) ... [2023-02-16 02:51:43,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f46753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:43, skipping insertion in model container [2023-02-16 02:51:43,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:51:43" (1/1) ... [2023-02-16 02:51:44,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 02:51:44,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 02:51:44,117 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-16 02:51:44,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:51:44,137 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 02:51:44,148 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-16 02:51:44,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:51:44,165 INFO L208 MainTranslator]: Completed translation [2023-02-16 02:51:44,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44 WrapperNode [2023-02-16 02:51:44,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 02:51:44,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 02:51:44,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 02:51:44,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 02:51:44,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,195 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-02-16 02:51:44,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 02:51:44,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 02:51:44,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 02:51:44,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 02:51:44,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 02:51:44,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 02:51:44,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 02:51:44,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 02:51:44,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (1/1) ... [2023-02-16 02:51:44,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:51:44,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:51:44,270 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-16 02:51:44,295 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-16 02:51:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 02:51:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-16 02:51:44,312 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-16 02:51:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 02:51:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 02:51:44,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 02:51:44,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 02:51:44,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 02:51:44,366 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 02:51:44,370 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 02:51:44,532 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 02:51:44,537 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 02:51:44,537 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 02:51:44,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:51:44 BoogieIcfgContainer [2023-02-16 02:51:44,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 02:51:44,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 02:51:44,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 02:51:44,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 02:51:44,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 02:51:43" (1/3) ... [2023-02-16 02:51:44,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1666b9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:51:44, skipping insertion in model container [2023-02-16 02:51:44,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:51:44" (2/3) ... [2023-02-16 02:51:44,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1666b9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:51:44, skipping insertion in model container [2023-02-16 02:51:44,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:51:44" (3/3) ... [2023-02-16 02:51:44,546 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2023-02-16 02:51:44,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 02:51:44,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 02:51:44,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 02:51:44,601 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;@3cdf3742, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 02:51:44,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 02:51:44,604 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-16 02:51:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 02:51:44,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:51:44,611 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:51:44,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:51:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:51:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2023-02-16 02:51:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:51:44,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342842762] [2023-02-16 02:51:44,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:51:44,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:51:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:51:44,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:51:44,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342842762] [2023-02-16 02:51:44,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-16 02:51:44,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76005737] [2023-02-16 02:51:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:51:44,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:51:44,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:51:44,773 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-16 02:51:44,813 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-16 02:51:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:51:44,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 02:51:44,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:51:44,880 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-16 02:51:44,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:51:44,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76005737] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:51:44,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:51:44,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 02:51:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314712413] [2023-02-16 02:51:44,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:51:44,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 02:51:44,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:51:44,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 02:51:44,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 02:51:44,932 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-16 02:51:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:51:44,953 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-02-16 02:51:44,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 02:51:44,955 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-16 02:51:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:51:44,960 INFO L225 Difference]: With dead ends: 45 [2023-02-16 02:51:44,961 INFO L226 Difference]: Without dead ends: 20 [2023-02-16 02:51:44,963 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-16 02:51:44,966 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-16 02:51:44,967 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-16 02:51:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-16 02:51:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-16 02:51:44,992 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-16 02:51:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-16 02:51:44,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2023-02-16 02:51:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:51:44,995 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-16 02:51:44,995 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-16 02:51:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-16 02:51:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 02:51:44,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:51:44,997 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:51:45,002 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-16 02:51:45,201 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-16 02:51:45,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:51:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:51:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2023-02-16 02:51:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:51:45,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150624880] [2023-02-16 02:51:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:51:45,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:51:45,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:51:45,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684839691] [2023-02-16 02:51:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:51:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:51:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:51:45,232 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-16 02:51:45,283 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-16 02:51:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:51:45,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 02:51:45,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:51:45,431 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-16 02:51:45,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:51:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:51:45,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150624880] [2023-02-16 02:51:45,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:51:45,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684839691] [2023-02-16 02:51:45,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684839691] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:51:45,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:51:45,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 02:51:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502310728] [2023-02-16 02:51:45,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:51:45,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 02:51:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:51:45,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 02:51:45,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 02:51:45,436 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-16 02:51:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:51:45,583 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-16 02:51:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 02:51:45,584 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-16 02:51:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:51:45,585 INFO L225 Difference]: With dead ends: 31 [2023-02-16 02:51:45,585 INFO L226 Difference]: Without dead ends: 27 [2023-02-16 02:51:45,587 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-16 02:51:45,588 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-16 02:51:45,593 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-16 02:51:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-16 02:51:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-16 02:51:45,600 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-16 02:51:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-16 02:51:45,601 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2023-02-16 02:51:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:51:45,601 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-16 02:51:45,602 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-16 02:51:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-16 02:51:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 02:51:45,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:51:45,603 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-16 02:51:45,609 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-16 02:51:45,809 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-16 02:51:45,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:51:45,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:51:45,810 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2023-02-16 02:51:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:51:45,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887808162] [2023-02-16 02:51:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:51:45,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:51:45,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:51:45,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365419965] [2023-02-16 02:51:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:51:45,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:51:45,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:51:45,846 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-16 02:51:45,849 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-16 02:51:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:51:45,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 02:51:45,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:51:46,041 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-16 02:51:46,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:51:46,368 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-16 02:51:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:51:46,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887808162] [2023-02-16 02:51:46,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:51:46,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365419965] [2023-02-16 02:51:46,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365419965] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:51:46,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:51:46,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-16 02:51:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844764872] [2023-02-16 02:51:46,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:51:46,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 02:51:46,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:51:46,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 02:51:46,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-16 02:51:46,377 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-16 02:51:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:51:46,512 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-16 02:51:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 02:51:46,513 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-16 02:51:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:51:46,515 INFO L225 Difference]: With dead ends: 38 [2023-02-16 02:51:46,516 INFO L226 Difference]: Without dead ends: 34 [2023-02-16 02:51:46,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-16 02:51:46,521 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-16 02:51:46,525 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-16 02:51:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-16 02:51:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-02-16 02:51:46,540 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-16 02:51:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-16 02:51:46,552 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2023-02-16 02:51:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:51:46,553 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-16 02:51:46,553 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-16 02:51:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-16 02:51:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 02:51:46,554 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:51:46,554 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-16 02:51:46,561 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-16 02:51:46,761 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-16 02:51:46,761 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:51:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:51:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2023-02-16 02:51:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:51:46,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001849295] [2023-02-16 02:51:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:51:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:51:46,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:51:46,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582497441] [2023-02-16 02:51:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:51:46,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:51:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:51:46,780 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-16 02:51:46,782 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-16 02:51:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:51:46,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 02:51:46,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:51:46,969 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-16 02:51:46,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:51:55,086 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_~y~0#1| |c_ULTIMATE.start_main_~k~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-16 02:52:21,160 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|))) (or (= (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) (= (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4|) .cse0)))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-16 02:52:39,247 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|))) (or (= (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) (= (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4|) .cse0)))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-16 02:53:05,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (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)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (= (+ |ULTIMATE.start_main_~k~0#1| (* |ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* 2 |c_ULTIMATE.start_main_~y~0#1|) .cse0 1)) (< (+ |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|)))))) is different from false [2023-02-16 02:53:07,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:53:07,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001849295] [2023-02-16 02:53:07,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:53:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582497441] [2023-02-16 02:53:07,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582497441] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:53:07,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-16 02:53:07,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-16 02:53:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200697964] [2023-02-16 02:53:07,940 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-16 02:53:07,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 02:53:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:53:07,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 02:53:07,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=10, NotChecked=92, Total=240 [2023-02-16 02:53:07,941 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-16 02:53:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:53:11,665 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-02-16 02:53:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 02:53:11,665 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-16 02:53:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:53:11,666 INFO L225 Difference]: With dead ends: 38 [2023-02-16 02:53:11,666 INFO L226 Difference]: Without dead ends: 32 [2023-02-16 02:53:11,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=56, Invalid=160, Unknown=10, NotChecked=116, Total=342 [2023-02-16 02:53:11,667 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-16 02:53:11,668 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-16 02:53:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-16 02:53:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-16 02:53:11,675 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-16 02:53:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-16 02:53:11,676 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-16 02:53:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:53:11,676 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-16 02:53:11,677 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-16 02:53:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-16 02:53:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 02:53:11,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:53:11,678 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-16 02:53:11,687 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-16 02:53:11,878 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-16 02:53:11,879 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:53:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:53:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2023-02-16 02:53:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:53:11,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203733270] [2023-02-16 02:53:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:53:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:53:11,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:53:11,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035045158] [2023-02-16 02:53:11,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 02:53:11,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:53:11,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:53:11,898 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-16 02:53:11,901 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-16 02:53:11,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 02:53:11,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:53:11,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 02:53:11,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:53:12,104 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-16 02:53:12,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:53:18,263 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (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)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (= (+ |ULTIMATE.start_main_~k~0#1| (* |ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* 2 |c_ULTIMATE.start_main_~y~0#1|) .cse0 1)) (< (+ |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|)))))) is different from false [2023-02-16 02:53:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:53:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203733270] [2023-02-16 02:53:18,265 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:53:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035045158] [2023-02-16 02:53:18,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035045158] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:53:18,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-16 02:53:18,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-16 02:53:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053829582] [2023-02-16 02:53:18,266 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-16 02:53:18,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 02:53:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:53:18,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 02:53:18,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2023-02-16 02:53:18,267 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-16 02:53:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:53:18,426 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-02-16 02:53:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 02:53:18,427 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-16 02:53:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:53:18,428 INFO L225 Difference]: With dead ends: 41 [2023-02-16 02:53:18,428 INFO L226 Difference]: Without dead ends: 35 [2023-02-16 02:53:18,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2023-02-16 02:53:18,429 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:53:18,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 127 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:53:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-16 02:53:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-16 02:53:18,437 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-16 02:53:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-16 02:53:18,438 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2023-02-16 02:53:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:53:18,439 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-16 02:53:18,439 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-16 02:53:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-16 02:53:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 02:53:18,440 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:53:18,440 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-16 02:53:18,449 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-16 02:53:18,646 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-16 02:53:18,646 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:53:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:53:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash 173594938, now seen corresponding path program 3 times [2023-02-16 02:53:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:53:18,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030578278] [2023-02-16 02:53:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:53:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:53:18,657 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:53:18,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384038331] [2023-02-16 02:53:18,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 02:53:18,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:53:18,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:53:18,673 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-16 02:53:18,676 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-16 02:53:18,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-16 02:53:18,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:53:18,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 02:53:18,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:53:18,985 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-16 02:53:18,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:53:25,159 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (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)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (= (+ |ULTIMATE.start_main_~k~0#1| (* |ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* 2 |c_ULTIMATE.start_main_~y~0#1|) .cse0 1)) (< (+ |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|)))))) is different from false [2023-02-16 02:53:25,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:53:25,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030578278] [2023-02-16 02:53:25,162 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:53:25,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384038331] [2023-02-16 02:53:25,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384038331] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:53:25,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-16 02:53:25,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-16 02:53:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616497830] [2023-02-16 02:53:25,163 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-16 02:53:25,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 02:53:25,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:53:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 02:53:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2023-02-16 02:53:25,164 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-16 02:53:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:53:25,332 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-02-16 02:53:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 02:53:25,333 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-16 02:53:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:53:25,334 INFO L225 Difference]: With dead ends: 44 [2023-02-16 02:53:25,334 INFO L226 Difference]: Without dead ends: 38 [2023-02-16 02:53:25,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2023-02-16 02:53:25,335 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-16 02:53:25,335 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-16 02:53:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-16 02:53:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-16 02:53:25,343 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-16 02:53:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-16 02:53:25,344 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2023-02-16 02:53:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:53:25,344 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-16 02:53:25,344 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-16 02:53:25,345 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-16 02:53:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-16 02:53:25,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:53:25,349 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-16 02:53:25,363 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-16 02:53:25,559 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-16 02:53:25,559 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:53:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:53:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1013596503, now seen corresponding path program 4 times [2023-02-16 02:53:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:53:25,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454213144] [2023-02-16 02:53:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:53:25,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:53:25,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:53:25,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385250198] [2023-02-16 02:53:25,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 02:53:25,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:53:25,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:53:25,580 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-16 02:53:25,582 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-16 02:53:25,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 02:53:25,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:53:25,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-16 02:53:25,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:53:25,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-16 02:53:25,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:53:26,200 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-16 02:53:26,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:53:26,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454213144] [2023-02-16 02:53:26,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:53:26,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385250198] [2023-02-16 02:53:26,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385250198] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:53:26,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:53:26,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-02-16 02:53:26,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916411909] [2023-02-16 02:53:26,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:53:26,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 02:53:26,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:53:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 02:53:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-02-16 02:53:26,205 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-16 02:53:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:53:27,040 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2023-02-16 02:53:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 02:53:27,041 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-16 02:53:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:53:27,042 INFO L225 Difference]: With dead ends: 63 [2023-02-16 02:53:27,042 INFO L226 Difference]: Without dead ends: 55 [2023-02-16 02:53:27,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2023-02-16 02:53:27,043 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 02:53:27,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 286 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 02:53:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-16 02:53:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-02-16 02:53:27,061 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-16 02:53:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-02-16 02:53:27,062 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 57 [2023-02-16 02:53:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:53:27,062 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-02-16 02:53:27,063 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-16 02:53:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-02-16 02:53:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-16 02:53:27,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:53:27,064 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-16 02:53:27,075 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-16 02:53:27,272 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-16 02:53:27,273 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:53:27,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:53:27,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1063034534, now seen corresponding path program 5 times [2023-02-16 02:53:27,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:53:27,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370233170] [2023-02-16 02:53:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:53:27,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:53:27,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:53:27,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823789412] [2023-02-16 02:53:27,285 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 02:53:27,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:53:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:53:27,286 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-16 02:53:27,320 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-16 02:53:28,653 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-16 02:53:28,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:53:28,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-16 02:53:28,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:53:28,926 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-16 02:53:28,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:53:35,012 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_~y~0#1| |c_ULTIMATE.start_main_~k~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-16 02:54:01,359 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_34| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) .cse0) (= (mod (+ (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) .cse0 (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|)) 12) 0)))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-16 02:54:19,400 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_34| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) .cse0) (= (mod (+ (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) .cse0 (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|)) 12) 0)))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-16 02:54:26,291 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_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) .cse0) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|) (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-16 02:54:34,428 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (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)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (= (+ |ULTIMATE.start_main_~k~0#1| (* |ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* 2 |c_ULTIMATE.start_main_~y~0#1|) .cse0 1)) (< (+ |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|)))))) is different from false [2023-02-16 02:54:36,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:54:36,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370233170] [2023-02-16 02:54:36,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:54:36,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823789412] [2023-02-16 02:54:36,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823789412] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:54:36,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-16 02:54:36,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2023-02-16 02:54:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639233087] [2023-02-16 02:54:36,447 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-16 02:54:36,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 02:54:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:54:36,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 02:54:36,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=308, Unknown=5, NotChecked=190, Total=552 [2023-02-16 02:54:36,448 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 12 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-16 02:54:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:54:36,843 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2023-02-16 02:54:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 02:54:36,847 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 12 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-16 02:54:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:54:36,848 INFO L225 Difference]: With dead ends: 62 [2023-02-16 02:54:36,848 INFO L226 Difference]: Without dead ends: 56 [2023-02-16 02:54:36,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=67, Invalid=410, Unknown=5, NotChecked=220, Total=702 [2023-02-16 02:54:36,850 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 02:54:36,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 316 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 02:54:36,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-16 02:54:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-16 02:54:36,879 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-16 02:54:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2023-02-16 02:54:36,882 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 92 [2023-02-16 02:54:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:54:36,883 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2023-02-16 02:54:36,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 12 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-16 02:54:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2023-02-16 02:54:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-16 02:54:36,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:54:36,890 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-16 02:54:36,900 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-16 02:54:37,098 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-16 02:54:37,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:54:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:54:37,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1524389175, now seen corresponding path program 6 times [2023-02-16 02:54:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:54:37,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791587443] [2023-02-16 02:54:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:54:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:54:37,115 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:54:37,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984293360] [2023-02-16 02:54:37,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 02:54:37,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:54:37,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:54:37,117 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-16 02:54:37,120 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-16 02:54:37,924 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-02-16 02:54:37,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:54:37,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-16 02:54:37,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:54:38,360 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-16 02:54:38,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:54:39,057 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-16 02:54:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:54:39,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791587443] [2023-02-16 02:54:39,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:54:39,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984293360] [2023-02-16 02:54:39,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984293360] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:54:39,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:54:39,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2023-02-16 02:54:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148326699] [2023-02-16 02:54:39,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:54:39,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-16 02:54:39,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:54:39,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-16 02:54:39,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2023-02-16 02:54:39,061 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-16 02:54:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:54:39,726 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2023-02-16 02:54:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 02:54:39,727 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-16 02:54:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:54:39,727 INFO L225 Difference]: With dead ends: 69 [2023-02-16 02:54:39,727 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 02:54:39,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2023-02-16 02:54:39,729 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 02:54:39,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 438 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 02:54:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 02:54:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 02:54:39,730 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-16 02:54:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 02:54:39,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2023-02-16 02:54:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:54:39,731 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 02:54:39,731 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-16 02:54:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 02:54:39,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 02:54:39,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 02:54:39,741 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-16 02:54:39,941 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-16 02:54:39,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 02:54:41,403 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 02:54:41,403 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse4 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse3 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (let ((.cse2 (or (= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~k~0#1|) .cse4) .cse3)) (.cse0 (= (+ (* 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|)) (* 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|))) (+ (* 12 |ULTIMATE.start_main_~x~0#1|) .cse4))) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 10))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|)) (and (<= |ULTIMATE.start_main_~c~0#1| 2) (<= 2 |ULTIMATE.start_main_~c~0#1|) .cse0 .cse1 (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 2)) (and (= |ULTIMATE.start_main_~y~0#1| 3) .cse2 .cse0 (<= 3 |ULTIMATE.start_main_~c~0#1|) .cse1 (<= |ULTIMATE.start_main_~c~0#1| 3)) (and (= |ULTIMATE.start_main_~y~0#1| 8) (= |ULTIMATE.start_main_~c~0#1| 8) .cse2 .cse0 .cse1) (and (= |ULTIMATE.start_main_~x~0#1| 0) (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (and (= |ULTIMATE.start_main_~c~0#1| 6) .cse2 .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 6)) (and (= |ULTIMATE.start_main_~y~0#1| 5) .cse2 .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| 5)) (and .cse2 .cse0 (= |ULTIMATE.start_main_~y~0#1| 7) .cse1 (= |ULTIMATE.start_main_~c~0#1| 7)) (and (= |ULTIMATE.start_main_~y~0#1| 9) (<= |ULTIMATE.start_main_~c~0#1| 9) .cse0 (<= 9 |ULTIMATE.start_main_~c~0#1|) .cse1 (< 8 |ULTIMATE.start_main_~k~0#1|)) (and (<= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 .cse1 (< 0 |ULTIMATE.start_main_~k~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 10) .cse0 (<= 10 |ULTIMATE.start_main_~k~0#1|) .cse1 (not .cse3))))) [2023-02-16 02:54:41,403 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-02-16 02:54:41,404 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-02-16 02:54:41,404 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10)) [2023-02-16 02:54:41,404 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 02:54:41,404 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 42) the Hoare annotation is: true [2023-02-16 02:54:41,404 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-02-16 02:54:41,404 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 02:54:41,404 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 02:54:41,404 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse4 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse3 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (let ((.cse2 (or (= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~k~0#1|) .cse4) .cse3)) (.cse0 (= (+ (* 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|)) (* 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|))) (+ (* 12 |ULTIMATE.start_main_~x~0#1|) .cse4))) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 10))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|)) (and (<= |ULTIMATE.start_main_~c~0#1| 2) (<= 2 |ULTIMATE.start_main_~c~0#1|) .cse0 .cse1 (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 2)) (and (= |ULTIMATE.start_main_~y~0#1| 3) .cse2 .cse0 (<= 3 |ULTIMATE.start_main_~c~0#1|) .cse1 (<= |ULTIMATE.start_main_~c~0#1| 3)) (and (= |ULTIMATE.start_main_~y~0#1| 8) (= |ULTIMATE.start_main_~c~0#1| 8) .cse2 .cse0 .cse1) (and (= |ULTIMATE.start_main_~x~0#1| 0) (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (and (= |ULTIMATE.start_main_~c~0#1| 6) .cse2 .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 6)) (and (= |ULTIMATE.start_main_~y~0#1| 5) .cse2 .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| 5)) (and .cse2 .cse0 (= |ULTIMATE.start_main_~y~0#1| 7) .cse1 (= |ULTIMATE.start_main_~c~0#1| 7)) (and (= |ULTIMATE.start_main_~y~0#1| 9) (<= |ULTIMATE.start_main_~c~0#1| 9) .cse0 (<= 9 |ULTIMATE.start_main_~c~0#1|) .cse1 (< 8 |ULTIMATE.start_main_~k~0#1|)) (and (<= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 .cse1 (< 0 |ULTIMATE.start_main_~k~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 10) .cse0 (<= 10 |ULTIMATE.start_main_~k~0#1|) .cse1 (not .cse3))))) [2023-02-16 02:54:41,404 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (= (+ (* 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|)) (* 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|))) (+ (* 12 |ULTIMATE.start_main_~x~0#1|) .cse1)))) (or (and (= |ULTIMATE.start_main_~y~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 2)) (let ((.cse4 (< (+ |ULTIMATE.start_main_~c~0#1| 3) |ULTIMATE.start_main_~k~0#1|)) (.cse2 (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)) (.cse3 (< (+ |ULTIMATE.start_main_~c~0#1| 2) |ULTIMATE.start_main_~k~0#1|))) (and (= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~k~0#1|) .cse1) (or .cse2 (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (or (not .cse3) .cse4) (or (not .cse4) (< (+ |ULTIMATE.start_main_~c~0#1| 4) |ULTIMATE.start_main_~k~0#1|)) (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse0 (or (not .cse2) .cse3) (<= |ULTIMATE.start_main_~k~0#1| 10))) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 (<= |ULTIMATE.start_main_~k~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))))) [2023-02-16 02:54:41,404 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-02-16 02:54:41,404 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (= (+ (* 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|)) (* 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|))) (+ (* 12 |ULTIMATE.start_main_~x~0#1|) .cse1)))) (or (and (= |ULTIMATE.start_main_~y~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 2)) (let ((.cse4 (< (+ |ULTIMATE.start_main_~c~0#1| 3) |ULTIMATE.start_main_~k~0#1|)) (.cse2 (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)) (.cse3 (< (+ |ULTIMATE.start_main_~c~0#1| 2) |ULTIMATE.start_main_~k~0#1|))) (and (= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~k~0#1|) .cse1) (or .cse2 (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (or (not .cse3) .cse4) (or (not .cse4) (< (+ |ULTIMATE.start_main_~c~0#1| 4) |ULTIMATE.start_main_~k~0#1|)) (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse0 (or (not .cse2) .cse3) (<= |ULTIMATE.start_main_~k~0#1| 10))) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 (<= |ULTIMATE.start_main_~k~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))))) [2023-02-16 02:54:41,405 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-02-16 02:54:41,405 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-16 02:54:41,405 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-02-16 02:54:41,405 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-02-16 02:54:41,405 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-16 02:54:41,405 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-16 02:54:41,405 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-16 02:54:41,405 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-16 02:54:41,405 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-16 02:54:41,405 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-16 02:54:41,408 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2023-02-16 02:54:41,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 02:54:41,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 02:54:41 BoogieIcfgContainer [2023-02-16 02:54:41,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 02:54:41,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 02:54:41,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 02:54:41,431 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 02:54:41,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:51:44" (3/4) ... [2023-02-16 02:54:41,435 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 02:54:41,442 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-16 02:54:41,443 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-16 02:54:41,446 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-16 02:54:41,446 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-16 02:54:41,447 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 02:54:41,447 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 02:54:41,475 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 02:54:41,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 02:54:41,476 INFO L158 Benchmark]: Toolchain (without parser) took 177483.27ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 87.2MB in the beginning and 72.2MB in the end (delta: 15.0MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2023-02-16 02:54:41,476 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 82.3MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:54:41,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.45ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 76.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 02:54:41,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.85ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 74.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 02:54:41,477 INFO L158 Benchmark]: Boogie Preprocessor took 42.89ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 73.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:54:41,477 INFO L158 Benchmark]: RCFGBuilder took 299.73ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 63.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 02:54:41,478 INFO L158 Benchmark]: TraceAbstraction took 176889.25ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 62.6MB in the beginning and 74.3MB in the end (delta: -11.8MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2023-02-16 02:54:41,478 INFO L158 Benchmark]: Witness Printer took 44.50ms. Allocated memory is still 148.9MB. Free memory was 74.3MB in the beginning and 72.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 02:54:41,479 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.16ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 82.3MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.45ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 76.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.85ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 74.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.89ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 73.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 299.73ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 63.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 176889.25ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 62.6MB in the beginning and 74.3MB in the end (delta: -11.8MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * Witness Printer took 44.50ms. Allocated memory is still 148.9MB. Free memory was 74.3MB in the beginning and 72.2MB in the end (delta: 2.2MB). 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: 176.8s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 1601 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1357 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2317 IncrementalHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 244 mSDtfsCounter, 2317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 711 GetRequests, 550 SyntacticMatches, 2 SemanticMatches, 159 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 43.3s 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, 1531 HoareAnnotationTreeSize, 43 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2102 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 163.9s InterpolantComputationTime, 456 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 2993 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1120 ConjunctsInSsa, 235 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: (((((((((((((6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y && k <= 10) && y == 4) && c == 4) && 3 < k) || (((((c <= 2 && 2 <= c) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10) && 1 < k) && y == 2)) || (((((y == 3 && (y * k == y * y || c < k)) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && 3 <= c) && k <= 10) && c <= 3)) || ((((y == 8 && c == 8) && (y * k == y * y || c < k)) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10)) || ((((x == 0 && 0 <= k) && k <= 10) && y == 0) && c == 0)) || ((((c == 6 && (y * k == y * y || c < k)) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10) && y == 6)) || ((((y == 5 && (y * k == y * y || c < k)) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10) && c == 5)) || (((((y * k == y * y || c < k) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && y == 7) && k <= 10) && c == 7)) || (((((y == 9 && c <= 9) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && 9 <= c) && k <= 10) && 8 < k)) || (((((c <= 1 && y == 1) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10) && 0 < k) && 1 <= c)) || ((((y == 10 && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && 10 <= k) && k <= 10) && !(c < k)) RESULT: Ultimate proved your program to be correct! [2023-02-16 02:54:41,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE