./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.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 e89b4ab54b22145b4041cfb458aca993f2d791ac86940dcd03d48a90a5273393 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 01:41:09,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:41:09,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:41:09,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:41:09,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:41:09,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:41:09,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:41:09,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:41:09,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:41:09,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:41:09,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:41:09,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:41:09,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:41:09,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:41:09,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:41:09,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:41:09,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:41:09,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:41:09,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:41:09,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:41:09,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:41:09,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:41:09,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:41:09,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:41:09,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:41:09,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:41:09,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:41:09,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:41:09,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:41:09,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:41:09,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:41:09,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:41:09,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:41:09,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:41:09,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:41:09,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:41:09,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:41:09,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:41:09,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:41:09,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:41:09,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:41:09,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:41:09,274 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:41:09,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:41:09,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:41:09,275 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:41:09,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:41:09,276 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:41:09,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:41:09,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:41:09,277 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:41:09,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:41:09,278 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:41:09,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:41:09,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:41:09,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:41:09,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:41:09,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:41:09,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:41:09,280 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:41:09,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:41:09,280 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:41:09,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:41:09,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:41:09,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:41:09,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:41:09,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:41:09,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:41:09,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:41:09,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:41:09,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:41:09,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:41:09,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:41:09,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:41:09,283 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:41:09,283 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:41:09,283 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:41:09,283 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 -> e89b4ab54b22145b4041cfb458aca993f2d791ac86940dcd03d48a90a5273393 [2023-02-17 01:41:09,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:41:09,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:41:09,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:41:09,541 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:41:09,541 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:41:09,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.c [2023-02-17 01:41:10,754 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:41:10,941 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:41:10,941 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound2.c [2023-02-17 01:41:10,949 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc26de34/9df2505104394378815a9c3cb83d875d/FLAG6588cacbb [2023-02-17 01:41:10,962 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc26de34/9df2505104394378815a9c3cb83d875d [2023-02-17 01:41:10,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:41:10,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:41:10,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:41:10,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:41:10,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:41:10,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:41:10" (1/1) ... [2023-02-17 01:41:10,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd5b335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:10, skipping insertion in model container [2023-02-17 01:41:10,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:41:10" (1/1) ... [2023-02-17 01:41:10,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:41:10,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:41:11,107 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/egcd-ll_valuebound2.c[489,502] [2023-02-17 01:41:11,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:41:11,139 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:41:11,150 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/egcd-ll_valuebound2.c[489,502] [2023-02-17 01:41:11,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:41:11,168 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:41:11,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11 WrapperNode [2023-02-17 01:41:11,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:41:11,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:41:11,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:41:11,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:41:11,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,196 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-02-17 01:41:11,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:41:11,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:41:11,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:41:11,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:41:11,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,210 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:41:11,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:41:11,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:41:11,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:41:11,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (1/1) ... [2023-02-17 01:41:11,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:41:11,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:11,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 01:41:11,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 01:41:11,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:41:11,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 01:41:11,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 01:41:11,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:41:11,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:41:11,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:41:11,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:41:11,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:41:11,338 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:41:11,340 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:41:11,449 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:41:11,454 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:41:11,454 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 01:41:11,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:41:11 BoogieIcfgContainer [2023-02-17 01:41:11,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:41:11,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:41:11,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:41:11,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:41:11,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:41:10" (1/3) ... [2023-02-17 01:41:11,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2acade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:41:11, skipping insertion in model container [2023-02-17 01:41:11,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:11" (2/3) ... [2023-02-17 01:41:11,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2acade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:41:11, skipping insertion in model container [2023-02-17 01:41:11,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:41:11" (3/3) ... [2023-02-17 01:41:11,463 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound2.c [2023-02-17 01:41:11,477 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:41:11,477 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:41:11,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:41:11,534 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;@425ce39e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:41:11,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:41:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-17 01:41:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 01:41:11,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:11,544 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:11,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash 501437177, now seen corresponding path program 1 times [2023-02-17 01:41:11,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:11,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499666688] [2023-02-17 01:41:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:11,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:11,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172501765] [2023-02-17 01:41:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:11,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:11,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:11,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 01:41:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:11,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 01:41:11,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 01:41:11,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-17 01:41:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:12,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499666688] [2023-02-17 01:41:12,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:12,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172501765] [2023-02-17 01:41:12,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172501765] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 01:41:12,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:41:12,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-02-17 01:41:12,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958696160] [2023-02-17 01:41:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:41:12,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:41:12,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:12,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:41:12,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-17 01:41:12,107 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 01:41:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:12,263 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2023-02-17 01:41:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:41:12,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-02-17 01:41:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:12,276 INFO L225 Difference]: With dead ends: 79 [2023-02-17 01:41:12,277 INFO L226 Difference]: Without dead ends: 42 [2023-02-17 01:41:12,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-17 01:41:12,285 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:12,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 145 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-17 01:41:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-02-17 01:41:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-17 01:41:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-02-17 01:41:12,318 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 29 [2023-02-17 01:41:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:12,319 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-02-17 01:41:12,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 01:41:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-02-17 01:41:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 01:41:12,321 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:12,321 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:12,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:12,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 01:41:12,527 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:12,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1017640517, now seen corresponding path program 1 times [2023-02-17 01:41:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:12,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111381137] [2023-02-17 01:41:12,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:12,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:12,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:12,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47755060] [2023-02-17 01:41:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:12,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:12,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:12,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 01:41:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:12,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-17 01:41:12,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-17 01:41:12,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:12,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:12,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111381137] [2023-02-17 01:41:12,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:12,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47755060] [2023-02-17 01:41:12,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47755060] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:41:12,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:41:12,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-17 01:41:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493101187] [2023-02-17 01:41:12,826 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:12,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 01:41:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:12,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 01:41:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-02-17 01:41:12,832 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 01:41:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:13,070 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2023-02-17 01:41:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 01:41:13,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 34 [2023-02-17 01:41:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:13,073 INFO L225 Difference]: With dead ends: 66 [2023-02-17 01:41:13,073 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 01:41:13,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-02-17 01:41:13,075 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:13,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 90 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 01:41:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 01:41:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2023-02-17 01:41:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 01:41:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2023-02-17 01:41:13,091 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 34 [2023-02-17 01:41:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:13,092 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2023-02-17 01:41:13,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 01:41:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2023-02-17 01:41:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 01:41:13,097 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:13,097 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:13,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:13,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 01:41:13,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1133401081, now seen corresponding path program 1 times [2023-02-17 01:41:13,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:13,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626618427] [2023-02-17 01:41:13,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:13,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:13,320 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:13,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758137028] [2023-02-17 01:41:13,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:13,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:13,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:13,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:13,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 01:41:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:13,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 01:41:13,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-17 01:41:13,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:41:13,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:13,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626618427] [2023-02-17 01:41:13,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:13,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758137028] [2023-02-17 01:41:13,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758137028] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:41:13,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:41:13,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 01:41:13,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004166414] [2023-02-17 01:41:13,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:41:13,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 01:41:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:13,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 01:41:13,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-02-17 01:41:13,460 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 01:41:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:13,582 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2023-02-17 01:41:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:41:13,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 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 39 [2023-02-17 01:41:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:13,586 INFO L225 Difference]: With dead ends: 64 [2023-02-17 01:41:13,587 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 01:41:13,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-17 01:41:13,590 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:13,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 131 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 01:41:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-02-17 01:41:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 01:41:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2023-02-17 01:41:13,618 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 39 [2023-02-17 01:41:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:13,619 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2023-02-17 01:41:13,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 01:41:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2023-02-17 01:41:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 01:41:13,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:13,623 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:13,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-17 01:41:13,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:13,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1954831506, now seen corresponding path program 1 times [2023-02-17 01:41:13,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:13,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996788484] [2023-02-17 01:41:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:13,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:13,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458622648] [2023-02-17 01:41:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:13,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:13,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 01:41:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:13,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 01:41:13,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 01:41:13,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:41:13,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:13,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996788484] [2023-02-17 01:41:13,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:13,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458622648] [2023-02-17 01:41:13,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458622648] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:41:13,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:41:13,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 01:41:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940164053] [2023-02-17 01:41:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:41:13,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:41:13,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:41:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:41:13,924 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-02-17 01:41:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:13,954 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-02-17 01:41:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 01:41:13,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2023-02-17 01:41:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:13,956 INFO L225 Difference]: With dead ends: 66 [2023-02-17 01:41:13,956 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 01:41:13,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 01:41:13,958 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:13,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 123 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:41:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 01:41:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-17 01:41:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 01:41:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2023-02-17 01:41:13,969 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 45 [2023-02-17 01:41:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:13,970 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2023-02-17 01:41:13,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-02-17 01:41:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2023-02-17 01:41:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 01:41:13,971 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:13,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:13,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:14,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:14,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1265228631, now seen corresponding path program 1 times [2023-02-17 01:41:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:14,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484448173] [2023-02-17 01:41:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:14,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:14,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:14,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445537959] [2023-02-17 01:41:14,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:14,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:14,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:14,196 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:14,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 01:41:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:14,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 01:41:14,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 01:41:14,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:14,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:14,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484448173] [2023-02-17 01:41:14,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:14,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445537959] [2023-02-17 01:41:14,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445537959] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:41:14,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:41:14,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-17 01:41:14,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642346402] [2023-02-17 01:41:14,361 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:14,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 01:41:14,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:14,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 01:41:14,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-17 01:41:14,363 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-17 01:41:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:14,460 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2023-02-17 01:41:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 01:41:14,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2023-02-17 01:41:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:14,463 INFO L225 Difference]: With dead ends: 80 [2023-02-17 01:41:14,463 INFO L226 Difference]: Without dead ends: 78 [2023-02-17 01:41:14,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:41:14,464 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:14,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 149 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-17 01:41:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-02-17 01:41:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-17 01:41:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2023-02-17 01:41:14,492 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 47 [2023-02-17 01:41:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:14,492 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2023-02-17 01:41:14,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-17 01:41:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2023-02-17 01:41:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-17 01:41:14,497 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:14,497 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:14,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:14,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:14,703 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:14,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1617953190, now seen corresponding path program 1 times [2023-02-17 01:41:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:14,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368535985] [2023-02-17 01:41:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:14,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:14,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:14,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325469837] [2023-02-17 01:41:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:14,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:14,727 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:14,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 01:41:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:14,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 01:41:14,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 01:41:14,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 01:41:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:14,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368535985] [2023-02-17 01:41:14,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:14,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325469837] [2023-02-17 01:41:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325469837] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:41:14,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:41:14,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-02-17 01:41:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431170811] [2023-02-17 01:41:14,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:14,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 01:41:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:14,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 01:41:14,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:41:14,916 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-17 01:41:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:15,043 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2023-02-17 01:41:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 01:41:15,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 50 [2023-02-17 01:41:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:15,045 INFO L225 Difference]: With dead ends: 84 [2023-02-17 01:41:15,045 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 01:41:15,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:41:15,046 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:15,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 127 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 01:41:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-17 01:41:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-17 01:41:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2023-02-17 01:41:15,058 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 50 [2023-02-17 01:41:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:15,059 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2023-02-17 01:41:15,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-17 01:41:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2023-02-17 01:41:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 01:41:15,060 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:15,060 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:15,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:15,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:15,272 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash 860577929, now seen corresponding path program 1 times [2023-02-17 01:41:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:15,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581005364] [2023-02-17 01:41:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:15,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:15,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:15,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675084000] [2023-02-17 01:41:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:15,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:15,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:15,285 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:15,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 01:41:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:15,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-17 01:41:15,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-17 01:41:15,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-17 01:41:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:15,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581005364] [2023-02-17 01:41:15,635 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:15,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675084000] [2023-02-17 01:41:15,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675084000] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:41:15,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:41:15,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2023-02-17 01:41:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974440131] [2023-02-17 01:41:15,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:15,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 01:41:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:15,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 01:41:15,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-17 01:41:15,637 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-17 01:41:17,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:41:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:18,120 INFO L93 Difference]: Finished difference Result 152 states and 195 transitions. [2023-02-17 01:41:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 01:41:18,122 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 52 [2023-02-17 01:41:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:18,123 INFO L225 Difference]: With dead ends: 152 [2023-02-17 01:41:18,124 INFO L226 Difference]: Without dead ends: 111 [2023-02-17 01:41:18,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-02-17 01:41:18,125 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:18,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 106 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-02-17 01:41:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-17 01:41:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2023-02-17 01:41:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-17 01:41:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2023-02-17 01:41:18,145 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 52 [2023-02-17 01:41:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:18,146 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2023-02-17 01:41:18,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-17 01:41:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2023-02-17 01:41:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 01:41:18,147 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:18,147 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:18,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:18,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:18,354 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:18,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1226126935, now seen corresponding path program 2 times [2023-02-17 01:41:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:18,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660445820] [2023-02-17 01:41:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:18,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:18,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750407651] [2023-02-17 01:41:18,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:41:18,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:18,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:18,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:18,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 01:41:18,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:41:18,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:41:18,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 01:41:18,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-02-17 01:41:18,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-17 01:41:18,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:18,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660445820] [2023-02-17 01:41:18,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:18,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750407651] [2023-02-17 01:41:18,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750407651] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:41:18,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:41:18,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2023-02-17 01:41:18,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906063502] [2023-02-17 01:41:18,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:18,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 01:41:18,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 01:41:18,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-17 01:41:18,551 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-17 01:41:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:18,941 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions. [2023-02-17 01:41:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:41:18,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 57 [2023-02-17 01:41:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:18,944 INFO L225 Difference]: With dead ends: 129 [2023-02-17 01:41:18,944 INFO L226 Difference]: Without dead ends: 118 [2023-02-17 01:41:18,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-17 01:41:18,945 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:18,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 01:41:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-17 01:41:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2023-02-17 01:41:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.078125) internal successors, (69), 67 states have internal predecessors, (69), 23 states have call successors, (23), 15 states have call predecessors, (23), 15 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 01:41:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2023-02-17 01:41:18,968 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 57 [2023-02-17 01:41:18,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:18,970 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2023-02-17 01:41:18,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-17 01:41:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2023-02-17 01:41:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 01:41:18,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:18,973 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:18,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:19,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-17 01:41:19,179 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1236716699, now seen corresponding path program 1 times [2023-02-17 01:41:19,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:19,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970256240] [2023-02-17 01:41:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:19,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:19,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085942788] [2023-02-17 01:41:19,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:19,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:19,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:19,192 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:19,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 01:41:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:19,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 01:41:19,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-17 01:41:19,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-17 01:41:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:19,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970256240] [2023-02-17 01:41:19,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:19,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085942788] [2023-02-17 01:41:19,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085942788] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:41:19,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:41:19,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-02-17 01:41:19,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832703651] [2023-02-17 01:41:19,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:19,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 01:41:19,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:19,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 01:41:19,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:41:19,360 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2023-02-17 01:41:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:19,495 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-02-17 01:41:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:41:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 65 [2023-02-17 01:41:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:19,497 INFO L225 Difference]: With dead ends: 134 [2023-02-17 01:41:19,497 INFO L226 Difference]: Without dead ends: 82 [2023-02-17 01:41:19,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:41:19,498 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:19,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 171 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:19,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-17 01:41:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-17 01:41:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 53 states have internal predecessors, (54), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-17 01:41:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2023-02-17 01:41:19,513 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 65 [2023-02-17 01:41:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:19,513 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2023-02-17 01:41:19,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2023-02-17 01:41:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2023-02-17 01:41:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 01:41:19,514 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:19,514 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:19,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-17 01:41:19,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:19,720 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1045444891, now seen corresponding path program 2 times [2023-02-17 01:41:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:19,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611041136] [2023-02-17 01:41:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:19,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:19,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928218872] [2023-02-17 01:41:19,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:41:19,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:19,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:19,732 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:19,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 01:41:19,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:41:19,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:41:19,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 01:41:19,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-17 01:41:19,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-17 01:41:19,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:19,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611041136] [2023-02-17 01:41:19,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:19,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928218872] [2023-02-17 01:41:19,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928218872] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:41:19,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:41:19,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-02-17 01:41:19,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778132873] [2023-02-17 01:41:19,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:19,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 01:41:19,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 01:41:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:41:19,870 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-17 01:41:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:19,962 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-02-17 01:41:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:41:19,962 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 65 [2023-02-17 01:41:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:19,963 INFO L225 Difference]: With dead ends: 86 [2023-02-17 01:41:19,963 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 01:41:19,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:41:19,965 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:19,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 125 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 01:41:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 01:41:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:41:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 01:41:19,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-02-17 01:41:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:19,967 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 01:41:19,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-17 01:41:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 01:41:19,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 01:41:19,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:41:19,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:20,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 01:41:20,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 01:41:20,195 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse2 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse7 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse17 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse11 (<= |ULTIMATE.start_main_~x~0#1| 2))) (let ((.cse0 (or (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse17 .cse9 .cse11))) (.cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse8 (let ((.cse19 (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (.cse18 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse18) (* |ULTIMATE.start_main_~y~0#1| .cse19))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse19)) (* |ULTIMATE.start_main_~s~0#1| .cse18)) 1)) (not (> |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))))) (.cse10 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse12 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse0 .cse1 .cse2 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (let ((.cse13 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse14 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (let ((.cse16 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) 1)))) (or (and .cse2 .cse3 .cse4 .cse16 .cse7 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse17 .cse9 .cse11))))) (or (and .cse2 .cse13 .cse3 .cse4 .cse14 .cse6 .cse7 .cse9 .cse11 .cse15 .cse12) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse11 .cse15 .cse12))) .cse6 .cse10) (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse2 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1) .cse12)))) [2023-02-17 01:41:20,195 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 01:41:20,196 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~y~0#1| 2) (>= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~x~0#1| 1) (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 2)) [2023-02-17 01:41:20,196 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse8 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~x~0#1| 2))) (let ((.cse4 (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse5 .cse6 .cse7 .cse2 .cse8 .cse3 .cse9 .cse10))) (.cse11 (= |ULTIMATE.start_main_~s~0#1| 1))) (let ((.cse0 (let ((.cse14 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (let ((.cse13 (or (and .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10) (and .cse4 .cse1 .cse5 .cse6 .cse7 .cse2 .cse14 .cse8 .cse9 .cse10 .cse11))) (.cse15 (let ((.cse21 (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (.cse20 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse20) (* |ULTIMATE.start_main_~y~0#1| .cse21))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse21)) (* |ULTIMATE.start_main_~s~0#1| .cse20)) 1)) (not (> |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))))) (.cse16 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (or (and .cse6 .cse13 .cse14 .cse15 .cse9 .cse16 .cse10) (let ((.cse17 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse18 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse19 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and (> .cse17 |ULTIMATE.start_main_~y~0#1|) .cse6 (= |ULTIMATE.start_main_~x~0#1| .cse17) (= .cse18 0) .cse13 .cse14 (= (+ (* .cse19 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse18))) 1) (= .cse19 1) .cse15 .cse9 .cse16 .cse10))))))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse2 .cse3 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (and .cse4 .cse5 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse6 .cse7 (= |ULTIMATE.start_main_~q~0#1| 0) .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse0 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse12) (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1) (= |ULTIMATE.start_main_~x~0#1| .cse12))) (and .cse0 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)))))) [2023-02-17 01:41:20,197 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse2 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse7 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse17 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse11 (<= |ULTIMATE.start_main_~x~0#1| 2))) (let ((.cse0 (or (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse17 .cse9 .cse11))) (.cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse8 (let ((.cse19 (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (.cse18 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse18) (* |ULTIMATE.start_main_~y~0#1| .cse19))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse19)) (* |ULTIMATE.start_main_~s~0#1| .cse18)) 1)) (not (> |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))))) (.cse10 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse12 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse0 .cse1 .cse2 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (let ((.cse13 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse14 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (let ((.cse16 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) 1)))) (or (and .cse2 .cse3 .cse4 .cse16 .cse7 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse17 .cse9 .cse11))))) (or (and .cse2 .cse13 .cse3 .cse4 .cse14 .cse6 .cse7 .cse9 .cse11 .cse15 .cse12) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse11 .cse15 .cse12))) .cse6 .cse10) (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse2 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1) .cse12)))) [2023-02-17 01:41:20,197 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 01:41:20,197 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 18 59) the Hoare annotation is: true [2023-02-17 01:41:20,197 INFO L899 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2023-02-17 01:41:20,197 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse14 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse22 (let ((.cse27 (+ |ULTIMATE.start_main_~r~0#1| .cse14)) (.cse26 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse26) (* |ULTIMATE.start_main_~y~0#1| .cse27))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse27)) (* |ULTIMATE.start_main_~s~0#1| .cse26)) 1)) (not (> |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))))) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse18 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse8 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse24 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse12 (<= |ULTIMATE.start_main_~x~0#1| 2)) (.cse23 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse25 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse3 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (let ((.cse15 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse19 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse20 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) 1))) (.cse0 (<= .cse25 .cse3)) (.cse1 (<= |ULTIMATE.start_main_~a~0#1| .cse3)) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse5 (or (and .cse2 .cse4 .cse18 .cse7 .cse8 .cse21 .cse22 .cse9 .cse10 .cse24 .cse12 .cse23) (and .cse2 .cse4 .cse18 .cse7 .cse8 .cse21 .cse9 .cse10 .cse24 .cse12 .cse23))) (.cse16 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse11 (<= .cse25 2))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse3) .cse4 .cse5 .cse6 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (let ((.cse13 (+ |ULTIMATE.start_main_~b~0#1| 1)) (.cse17 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse13 2) (= (+ .cse14 0) |ULTIMATE.start_main_~r~0#1|) .cse4 .cse15 .cse16 (> .cse17 |ULTIMATE.start_main_~y~0#1|) .cse18 (<= .cse13 .cse3) .cse7 (= |ULTIMATE.start_main_~x~0#1| .cse17) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) .cse19 .cse20 .cse21 .cse22 .cse10 .cse12 .cse23)) (and .cse2 .cse4 .cse6 .cse15 (<= |ULTIMATE.start_main_~b~0#1| 2) .cse18 .cse7 .cse8 .cse19 .cse20 .cse21 .cse9 .cse10 .cse24 .cse12 .cse23) (and .cse0 .cse1 .cse4 .cse6 (or (and .cse5 (or (not .cse24) .cse16)) (and .cse5 .cse16)) .cse7 .cse10 .cse11 .cse12))))) [2023-02-17 01:41:20,198 INFO L895 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse14 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse22 (let ((.cse27 (+ |ULTIMATE.start_main_~r~0#1| .cse14)) (.cse26 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse26) (* |ULTIMATE.start_main_~y~0#1| .cse27))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse27)) (* |ULTIMATE.start_main_~s~0#1| .cse26)) 1)) (not (> |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))))) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse18 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse8 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse24 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse12 (<= |ULTIMATE.start_main_~x~0#1| 2)) (.cse23 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse25 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse3 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (let ((.cse15 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse19 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse20 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) 1))) (.cse0 (<= .cse25 .cse3)) (.cse1 (<= |ULTIMATE.start_main_~a~0#1| .cse3)) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse5 (or (and .cse2 .cse4 .cse18 .cse7 .cse8 .cse21 .cse22 .cse9 .cse10 .cse24 .cse12 .cse23) (and .cse2 .cse4 .cse18 .cse7 .cse8 .cse21 .cse9 .cse10 .cse24 .cse12 .cse23))) (.cse16 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse11 (<= .cse25 2))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse3) .cse4 .cse5 .cse6 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (let ((.cse13 (+ |ULTIMATE.start_main_~b~0#1| 1)) (.cse17 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse13 2) (= (+ .cse14 0) |ULTIMATE.start_main_~r~0#1|) .cse4 .cse15 .cse16 (> .cse17 |ULTIMATE.start_main_~y~0#1|) .cse18 (<= .cse13 .cse3) .cse7 (= |ULTIMATE.start_main_~x~0#1| .cse17) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) .cse19 .cse20 .cse21 .cse22 .cse10 .cse12 .cse23)) (and .cse2 .cse4 .cse6 .cse15 (<= |ULTIMATE.start_main_~b~0#1| 2) .cse18 .cse7 .cse8 .cse19 .cse20 .cse21 .cse9 .cse10 .cse24 .cse12 .cse23) (and .cse0 .cse1 .cse4 .cse6 (or (and .cse5 (or (not .cse24) .cse16)) (and .cse5 .cse16)) .cse7 .cse10 .cse11 .cse12))))) [2023-02-17 01:41:20,198 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 01:41:20,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 01:41:20,198 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-17 01:41:20,198 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-02-17 01:41:20,198 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 2)) [2023-02-17 01:41:20,198 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~y~0#1| 2) (>= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 2)) [2023-02-17 01:41:20,199 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse2 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse7 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse14 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse11 (<= |ULTIMATE.start_main_~x~0#1| 2))) (let ((.cse0 (or (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse14 .cse9 .cse11))) (.cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse8 (let ((.cse16 (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (.cse15 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse15) (* |ULTIMATE.start_main_~y~0#1| .cse16))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse16)) (* |ULTIMATE.start_main_~s~0#1| .cse15)) 1)) (not (> |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))))) (.cse10 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse12 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse0 .cse1 .cse2 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse2 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse3 .cse4 (= |ULTIMATE.start_main_~q~0#1| 0) .cse7 .cse9 .cse11 (let ((.cse13 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) 1)))) (or (and .cse2 .cse3 .cse4 .cse13 .cse7 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse14 .cse9 .cse11))) .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse2 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1) .cse12)))) [2023-02-17 01:41:20,199 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2023-02-17 01:41:20,199 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-17 01:41:20,199 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-02-17 01:41:20,199 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (let ((.cse14 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse22 (let ((.cse27 (+ |ULTIMATE.start_main_~r~0#1| .cse14)) (.cse26 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse26) (* |ULTIMATE.start_main_~y~0#1| .cse27))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse27)) (* |ULTIMATE.start_main_~s~0#1| .cse26)) 1)) (not (> |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))))) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse18 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse8 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse24 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse12 (<= |ULTIMATE.start_main_~x~0#1| 2)) (.cse23 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse25 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse3 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (let ((.cse15 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse19 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse20 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) 1))) (.cse0 (<= .cse25 .cse3)) (.cse1 (<= |ULTIMATE.start_main_~a~0#1| .cse3)) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse5 (or (and .cse2 .cse4 .cse18 .cse7 .cse8 .cse21 .cse22 .cse9 .cse10 .cse24 .cse12 .cse23) (and .cse2 .cse4 .cse18 .cse7 .cse8 .cse21 .cse9 .cse10 .cse24 .cse12 .cse23))) (.cse16 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse11 (<= .cse25 2))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse3) .cse4 .cse5 .cse6 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (let ((.cse13 (+ |ULTIMATE.start_main_~b~0#1| 1)) (.cse17 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse13 2) (= (+ .cse14 0) |ULTIMATE.start_main_~r~0#1|) .cse4 .cse15 .cse16 (> .cse17 |ULTIMATE.start_main_~y~0#1|) .cse18 (<= .cse13 .cse3) .cse7 (= |ULTIMATE.start_main_~x~0#1| .cse17) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) .cse19 .cse20 .cse21 .cse22 .cse10 .cse12 .cse23)) (and .cse2 .cse4 .cse6 .cse15 (<= |ULTIMATE.start_main_~b~0#1| 2) .cse18 .cse7 .cse8 .cse19 .cse20 .cse21 .cse9 .cse10 .cse24 .cse12 .cse23) (and .cse0 .cse1 .cse4 .cse6 (or (and .cse5 (or (not .cse24) .cse16)) (and .cse5 .cse16)) .cse7 .cse10 .cse11 .cse12))))) [2023-02-17 01:41:20,200 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse21 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse2 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse10 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse3 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse18 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse16 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse8 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) 1))) (.cse9 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse19 (let ((.cse24 (+ |ULTIMATE.start_main_~r~0#1| .cse21)) (.cse23 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse23) (* |ULTIMATE.start_main_~y~0#1| .cse24))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse24)) (* |ULTIMATE.start_main_~s~0#1| .cse23)) 1)) (not (> |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))))) (.cse11 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse12 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse13 (<= |ULTIMATE.start_main_~x~0#1| 2)) (.cse14 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~b~0#1| 2) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ |ULTIMATE.start_main_~a~0#1| 1))) (and (<= .cse15 .cse16) (<= |ULTIMATE.start_main_~a~0#1| .cse16) .cse1 .cse2 .cse5 .cse11 (<= .cse15 2) .cse13 (let ((.cse17 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse16) .cse17 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse6 .cse10 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (and .cse17 .cse18))))) (let ((.cse20 (+ |ULTIMATE.start_main_~b~0#1| 1)) (.cse22 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse20 2) (= (+ .cse21 0) |ULTIMATE.start_main_~r~0#1|) .cse1 .cse3 .cse18 (> .cse22 |ULTIMATE.start_main_~y~0#1|) .cse4 (<= .cse20 .cse16) .cse5 (= |ULTIMATE.start_main_~x~0#1| .cse22) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) 1) .cse7 .cse8 .cse9 .cse19 .cse11 .cse12 .cse13 .cse14))))) [2023-02-17 01:41:20,200 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-02-17 01:41:20,200 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-17 01:41:20,200 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-02-17 01:41:20,200 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-02-17 01:41:20,200 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2023-02-17 01:41:20,200 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2023-02-17 01:41:20,200 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2023-02-17 01:41:20,200 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 16) the Hoare annotation is: true [2023-02-17 01:41:20,200 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2023-02-17 01:41:20,201 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-02-17 01:41:20,204 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:20,206 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:41:20,217 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:20,218 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:20,237 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:20,237 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:20,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:41:20 BoogieIcfgContainer [2023-02-17 01:41:20,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:41:20,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:41:20,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:41:20,241 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:41:20,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:41:11" (3/4) ... [2023-02-17 01:41:20,243 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 01:41:20,248 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-17 01:41:20,248 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 01:41:20,251 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-17 01:41:20,251 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 01:41:20,252 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 01:41:20,252 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 01:41:20,295 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:41:20,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:41:20,296 INFO L158 Benchmark]: Toolchain (without parser) took 9329.09ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 67.3MB in the beginning and 38.9MB in the end (delta: 28.5MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2023-02-17 01:41:20,296 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:41:20,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.40ms. Allocated memory is still 111.1MB. Free memory was 67.3MB in the beginning and 56.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:41:20,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.60ms. Allocated memory is still 111.1MB. Free memory was 56.6MB in the beginning and 55.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:41:20,296 INFO L158 Benchmark]: Boogie Preprocessor took 15.17ms. Allocated memory is still 111.1MB. Free memory was 55.2MB in the beginning and 54.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:41:20,297 INFO L158 Benchmark]: RCFGBuilder took 243.36ms. Allocated memory is still 111.1MB. Free memory was 54.0MB in the beginning and 80.0MB in the end (delta: -26.0MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-02-17 01:41:20,297 INFO L158 Benchmark]: TraceAbstraction took 8782.02ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 79.4MB in the beginning and 42.0MB in the end (delta: 37.4MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2023-02-17 01:41:20,298 INFO L158 Benchmark]: Witness Printer took 54.70ms. Allocated memory is still 134.2MB. Free memory was 42.0MB in the beginning and 38.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:41:20,299 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.17ms. Allocated memory is still 92.3MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.40ms. Allocated memory is still 111.1MB. Free memory was 67.3MB in the beginning and 56.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.60ms. Allocated memory is still 111.1MB. Free memory was 56.6MB in the beginning and 55.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.17ms. Allocated memory is still 111.1MB. Free memory was 55.2MB in the beginning and 54.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 243.36ms. Allocated memory is still 111.1MB. Free memory was 54.0MB in the beginning and 80.0MB in the end (delta: -26.0MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8782.02ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 79.4MB in the beginning and 42.0MB in the end (delta: 37.4MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Witness Printer took 54.70ms. Allocated memory is still 134.2MB. Free memory was 42.0MB in the beginning and 38.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] * 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: 13]: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 287 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 230 mSDsluCounter, 1263 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 952 mSDsCounter, 221 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1764 IncrementalHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 221 mSolverCounterUnsat, 311 mSDtfsCounter, 1764 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 692 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=8, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 45 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 77 PreInvPairs, 110 NumberOfFragments, 5489 HoareAnnotationTreeSize, 77 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 785 ConstructedInterpolants, 2 QuantifiedInterpolants, 2923 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1263 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 908/1002 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: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant [2023-02-17 01:41:20,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:20,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:20,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:20,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] Derived loop invariant: ((((((((((((((((a + 1 <= a + b && a <= a + b) && p == 1) && y == a + b) && y <= 2) && ((((((((((((p == 1 && y <= 2) && y >= 1) && y >= 0) && r == 0) && x >= 1) && ((a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1)) || !(a > b))) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1) || ((((((((((p == 1 && y <= 2) && y >= 1) && y >= 0) && r == 0) && x >= 1) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1))) && a <= 2) && -p + 0 == q) && y >= 0) && r == 0) && a == x) && x >= 0) && a + 1 <= 2) && x <= 2) && r + s == 1) || (((((((((((((((((b + 1 <= 2 && -s + 0 == r) && y <= 2) && b == y) && s * y + q * x == b) && a + y > y) && y >= 1) && b + 1 <= a + b) && y >= 0) && x == a + y) && p + q == 1) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && x >= 1) && ((a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1)) || !(a > b))) && x >= 0) && x <= 2) && s == 1)) || (((((((((((((((p == 1 && y <= 2) && a <= 2) && b == y) && b <= 2) && y >= 1) && y >= 0) && r == 0) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && x >= 1) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1)) || ((((((((a + 1 <= a + b && a <= a + b) && y <= 2) && a <= 2) && ((((((((((((((p == 1 && y <= 2) && y >= 1) && y >= 0) && r == 0) && x >= 1) && ((a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1)) || !(a > b))) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1) || ((((((((((p == 1 && y <= 2) && y >= 1) && y >= 0) && r == 0) && x >= 1) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1)) && (!(r * y + p * x == a) || s * y + q * x == b)) || (((((((((((((p == 1 && y <= 2) && y >= 1) && y >= 0) && r == 0) && x >= 1) && ((a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1)) || !(a > b))) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1) || ((((((((((p == 1 && y <= 2) && y >= 1) && y >= 0) && r == 0) && x >= 1) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1)) && s * y + q * x == b))) && y >= 0) && x >= 0) && a + 1 <= 2) && x <= 2) RESULT: Ultimate proved your program to be correct! [2023-02-17 01:41:20,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE