./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.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 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 18:01:26,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 18:01:26,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 18:01:26,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 18:01:26,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 18:01:26,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 18:01:26,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 18:01:26,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 18:01:26,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 18:01:26,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 18:01:26,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 18:01:26,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 18:01:26,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 18:01:26,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 18:01:26,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 18:01:26,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 18:01:26,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 18:01:26,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 18:01:26,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 18:01:26,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 18:01:26,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 18:01:26,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 18:01:26,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 18:01:26,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 18:01:26,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 18:01:26,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 18:01:26,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 18:01:26,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 18:01:26,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 18:01:26,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 18:01:26,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 18:01:26,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 18:01:26,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 18:01:26,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 18:01:26,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 18:01:26,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 18:01:26,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 18:01:26,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 18:01:26,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 18:01:26,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 18:01:26,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 18:01:26,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 18:01:26,461 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 18:01:26,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 18:01:26,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 18:01:26,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 18:01:26,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 18:01:26,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 18:01:26,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 18:01:26,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 18:01:26,463 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 18:01:26,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 18:01:26,464 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 18:01:26,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 18:01:26,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 18:01:26,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 18:01:26,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 18:01:26,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 18:01:26,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 18:01:26,471 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 18:01:26,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 18:01:26,471 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 18:01:26,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 18:01:26,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 18:01:26,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 18:01:26,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 18:01:26,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:01:26,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 18:01:26,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 18:01:26,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 18:01:26,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 18:01:26,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 18:01:26,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 18:01:26,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 18:01:26,473 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 18:01:26,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 18:01:26,474 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 18:01:26,474 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 -> 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 [2023-02-18 18:01:26,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 18:01:26,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 18:01:26,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 18:01:26,825 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 18:01:26,825 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 18:01:26,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2023-02-18 18:01:28,506 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 18:01:28,761 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 18:01:28,761 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2023-02-18 18:01:28,767 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff504267/ad5a8d21c99a46809bd0c597c86c7c40/FLAGe504dece5 [2023-02-18 18:01:28,806 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff504267/ad5a8d21c99a46809bd0c597c86c7c40 [2023-02-18 18:01:28,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 18:01:28,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 18:01:28,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 18:01:28,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 18:01:28,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 18:01:28,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:01:28" (1/1) ... [2023-02-18 18:01:28,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef0b0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:28, skipping insertion in model container [2023-02-18 18:01:28,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:01:28" (1/1) ... [2023-02-18 18:01:28,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 18:01:28,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 18:01:29,047 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/hard-ll_valuebound1.c[538,551] [2023-02-18 18:01:29,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:01:29,083 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 18:01:29,120 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/hard-ll_valuebound1.c[538,551] [2023-02-18 18:01:29,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:01:29,145 INFO L208 MainTranslator]: Completed translation [2023-02-18 18:01:29,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29 WrapperNode [2023-02-18 18:01:29,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 18:01:29,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 18:01:29,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 18:01:29,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 18:01:29,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,197 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-02-18 18:01:29,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 18:01:29,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 18:01:29,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 18:01:29,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 18:01:29,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,261 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 18:01:29,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 18:01:29,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 18:01:29,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 18:01:29,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (1/1) ... [2023-02-18 18:01:29,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:01:29,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:01:29,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 18:01:29,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 18:01:29,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 18:01:29,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 18:01:29,389 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 18:01:29,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 18:01:29,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 18:01:29,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 18:01:29,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 18:01:29,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 18:01:29,433 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 18:01:29,434 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 18:01:29,604 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 18:01:29,618 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 18:01:29,632 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 18:01:29,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:01:29 BoogieIcfgContainer [2023-02-18 18:01:29,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 18:01:29,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 18:01:29,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 18:01:29,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 18:01:29,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 06:01:28" (1/3) ... [2023-02-18 18:01:29,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51185f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:01:29, skipping insertion in model container [2023-02-18 18:01:29,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:01:29" (2/3) ... [2023-02-18 18:01:29,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51185f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:01:29, skipping insertion in model container [2023-02-18 18:01:29,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:01:29" (3/3) ... [2023-02-18 18:01:29,650 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2023-02-18 18:01:29,684 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 18:01:29,697 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 18:01:29,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 18:01:29,764 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;@432307d5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 18:01:29,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 18:01:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 18:01:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 18:01:29,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:01:29,817 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:01:29,818 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:01:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:01:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -487550744, now seen corresponding path program 1 times [2023-02-18 18:01:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:01:29,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423352314] [2023-02-18 18:01:29,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:01:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 18:01:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 18:01:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 18:01:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 18:01:30,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:01:30,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423352314] [2023-02-18 18:01:30,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423352314] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:01:30,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:01:30,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 18:01:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693963834] [2023-02-18 18:01:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:01:30,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 18:01:30,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:01:30,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 18:01:30,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 18:01:30,062 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 18:01:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:01:30,083 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2023-02-18 18:01:30,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 18:01:30,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-02-18 18:01:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:01:30,090 INFO L225 Difference]: With dead ends: 63 [2023-02-18 18:01:30,090 INFO L226 Difference]: Without dead ends: 29 [2023-02-18 18:01:30,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 18:01:30,096 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:01:30,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:01:30,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-18 18:01:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-18 18:01:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 18:01:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2023-02-18 18:01:30,127 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 24 [2023-02-18 18:01:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:01:30,127 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2023-02-18 18:01:30,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 18:01:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2023-02-18 18:01:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 18:01:30,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:01:30,130 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:01:30,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 18:01:30,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:01:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:01:30,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1636258074, now seen corresponding path program 1 times [2023-02-18 18:01:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:01:30,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848248427] [2023-02-18 18:01:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:01:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 18:01:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 18:01:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 18:01:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 18:01:30,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:01:30,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848248427] [2023-02-18 18:01:30,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848248427] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:01:30,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:01:30,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:01:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104609389] [2023-02-18 18:01:30,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:01:30,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:01:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:01:30,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:01:30,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:01:30,339 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 18:01:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:01:30,397 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2023-02-18 18:01:30,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:01:30,398 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-02-18 18:01:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:01:30,399 INFO L225 Difference]: With dead ends: 42 [2023-02-18 18:01:30,399 INFO L226 Difference]: Without dead ends: 40 [2023-02-18 18:01:30,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 18:01:30,400 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:01:30,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 128 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:01:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-18 18:01:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2023-02-18 18:01:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 18:01:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-02-18 18:01:30,424 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 24 [2023-02-18 18:01:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:01:30,424 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-02-18 18:01:30,424 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 18:01:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-02-18 18:01:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 18:01:30,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:01:30,425 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:01:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 18:01:30,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:01:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:01:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 906849917, now seen corresponding path program 1 times [2023-02-18 18:01:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:01:30,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042552179] [2023-02-18 18:01:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:01:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 18:01:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 18:01:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 18:01:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-18 18:01:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 18:01:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:01:30,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042552179] [2023-02-18 18:01:30,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042552179] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:01:30,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:01:30,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:01:30,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417990963] [2023-02-18 18:01:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:01:30,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:01:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:01:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:01:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:01:30,525 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 18:01:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:01:30,584 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2023-02-18 18:01:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:01:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-02-18 18:01:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:01:30,585 INFO L225 Difference]: With dead ends: 46 [2023-02-18 18:01:30,585 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 18:01:30,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 18:01:30,587 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:01:30,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 123 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:01:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 18:01:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-02-18 18:01:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 18:01:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-02-18 18:01:30,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 29 [2023-02-18 18:01:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:01:30,594 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-02-18 18:01:30,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 18:01:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-02-18 18:01:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-18 18:01:30,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:01:30,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:01:30,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 18:01:30,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:01:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:01:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 710995206, now seen corresponding path program 1 times [2023-02-18 18:01:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:01:30,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477151854] [2023-02-18 18:01:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:01:30,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:01:30,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [24921429] [2023-02-18 18:01:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:30,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:30,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:01:30,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:01:30,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 18:01:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:30,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 18:01:30,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:01:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 18:01:30,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:01:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 18:01:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:01:31,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477151854] [2023-02-18 18:01:31,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:01:31,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24921429] [2023-02-18 18:01:31,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24921429] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:01:31,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:01:31,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2023-02-18 18:01:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246912854] [2023-02-18 18:01:31,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:01:31,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 18:01:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:01:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 18:01:31,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-18 18:01:31,241 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 16 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 18:01:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:01:31,523 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2023-02-18 18:01:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 18:01:31,524 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 34 [2023-02-18 18:01:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:01:31,527 INFO L225 Difference]: With dead ends: 69 [2023-02-18 18:01:31,528 INFO L226 Difference]: Without dead ends: 54 [2023-02-18 18:01:31,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-02-18 18:01:31,535 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 18:01:31,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 111 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 18:01:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-18 18:01:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-02-18 18:01:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-18 18:01:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-02-18 18:01:31,554 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 34 [2023-02-18 18:01:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:01:31,555 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-02-18 18:01:31,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 18:01:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-02-18 18:01:31,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-18 18:01:31,558 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:01:31,559 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:01:31,579 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-18 18:01:31,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:31,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:01:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:01:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1829555286, now seen corresponding path program 1 times [2023-02-18 18:01:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:01:31,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078210946] [2023-02-18 18:01:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:01:31,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:01:31,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206618458] [2023-02-18 18:01:31,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:31,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:31,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:01:31,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:01:31,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 18:01:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:31,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 18:01:31,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:01:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 18:01:31,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:01:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 18:01:32,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:01:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078210946] [2023-02-18 18:01:32,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:01:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206618458] [2023-02-18 18:01:32,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206618458] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:01:32,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:01:32,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-02-18 18:01:32,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617508448] [2023-02-18 18:01:32,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:01:32,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 18:01:32,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:01:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 18:01:32,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-18 18:01:32,136 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-18 18:01:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:01:32,673 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2023-02-18 18:01:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 18:01:32,674 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 41 [2023-02-18 18:01:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:01:32,675 INFO L225 Difference]: With dead ends: 66 [2023-02-18 18:01:32,675 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 18:01:32,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-02-18 18:01:32,676 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 18:01:32,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 18:01:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 18:01:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-18 18:01:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-18 18:01:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-02-18 18:01:32,690 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 41 [2023-02-18 18:01:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:01:32,691 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-02-18 18:01:32,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-18 18:01:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-02-18 18:01:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-18 18:01:32,693 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:01:32,693 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 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-18 18:01:32,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 18:01:32,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:32,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:01:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:01:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash -677073599, now seen corresponding path program 1 times [2023-02-18 18:01:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:01:32,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885172095] [2023-02-18 18:01:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:32,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:01:32,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:01:32,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [54998064] [2023-02-18 18:01:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:01:32,917 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:01:33,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 18:01:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:33,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 18:01:33,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:01:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-18 18:01:33,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:01:33,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:01:33,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885172095] [2023-02-18 18:01:33,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:01:33,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54998064] [2023-02-18 18:01:33,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54998064] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:01:33,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:01:33,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 18:01:33,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104435583] [2023-02-18 18:01:33,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:01:33,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 18:01:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:01:33,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 18:01:33,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 18:01:33,047 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-18 18:01:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:01:33,091 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-02-18 18:01:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 18:01:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 69 [2023-02-18 18:01:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:01:33,095 INFO L225 Difference]: With dead ends: 70 [2023-02-18 18:01:33,095 INFO L226 Difference]: Without dead ends: 63 [2023-02-18 18:01:33,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 18:01:33,096 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:01:33,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 89 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:01:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-18 18:01:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-18 18:01:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 18:01:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-02-18 18:01:33,119 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 69 [2023-02-18 18:01:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:01:33,119 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-02-18 18:01:33,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-18 18:01:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-02-18 18:01:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-18 18:01:33,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:01:33,123 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 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-18 18:01:33,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 18:01:33,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:33,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:01:33,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:01:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1754894755, now seen corresponding path program 1 times [2023-02-18 18:01:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:01:33,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181053910] [2023-02-18 18:01:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:01:33,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:01:33,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415051404] [2023-02-18 18:01:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:33,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:33,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:01:33,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:01:33,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 18:01:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:33,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-18 18:01:33,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:01:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-02-18 18:01:33,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:01:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-18 18:01:34,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:01:34,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181053910] [2023-02-18 18:01:34,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:01:34,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415051404] [2023-02-18 18:01:34,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415051404] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:01:34,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:01:34,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-02-18 18:01:34,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442762196] [2023-02-18 18:01:34,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:01:34,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 18:01:34,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:01:34,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 18:01:34,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-02-18 18:01:34,443 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 8 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 18:01:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:01:38,902 INFO L93 Difference]: Finished difference Result 145 states and 178 transitions. [2023-02-18 18:01:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 18:01:38,902 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 8 states have call predecessors, (22), 7 states have call successors, (22) Word has length 71 [2023-02-18 18:01:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:01:38,904 INFO L225 Difference]: With dead ends: 145 [2023-02-18 18:01:38,904 INFO L226 Difference]: Without dead ends: 106 [2023-02-18 18:01:38,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2023-02-18 18:01:38,905 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-18 18:01:38,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 183 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-02-18 18:01:38,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-18 18:01:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2023-02-18 18:01:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 66 states have internal predecessors, (70), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-18 18:01:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2023-02-18 18:01:38,928 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 71 [2023-02-18 18:01:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:01:38,928 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2023-02-18 18:01:38,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 8 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 18:01:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2023-02-18 18:01:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-02-18 18:01:38,929 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:01:38,929 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:01:38,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 18:01:39,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:39,134 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:01:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:01:39,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1620227847, now seen corresponding path program 1 times [2023-02-18 18:01:39,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:01:39,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259857152] [2023-02-18 18:01:39,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:39,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:01:39,143 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:01:39,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149587037] [2023-02-18 18:01:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:39,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:39,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:01:39,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:01:39,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 18:01:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:01:39,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 18:01:39,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:01:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-02-18 18:01:39,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:01:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-02-18 18:01:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:01:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259857152] [2023-02-18 18:01:40,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:01:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149587037] [2023-02-18 18:01:40,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149587037] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:01:40,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:01:40,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2023-02-18 18:01:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228976428] [2023-02-18 18:01:40,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:01:40,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 18:01:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:01:40,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 18:01:40,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2023-02-18 18:01:40,214 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-18 18:01:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:01:44,660 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2023-02-18 18:01:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 18:01:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) Word has length 82 [2023-02-18 18:01:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:01:44,662 INFO L225 Difference]: With dead ends: 133 [2023-02-18 18:01:44,662 INFO L226 Difference]: Without dead ends: 125 [2023-02-18 18:01:44,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 135 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2023-02-18 18:01:44,663 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-18 18:01:44,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 261 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-02-18 18:01:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-18 18:01:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 118. [2023-02-18 18:01:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 77 states have internal predecessors, (85), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2023-02-18 18:01:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2023-02-18 18:01:44,711 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 82 [2023-02-18 18:01:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:01:44,712 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2023-02-18 18:01:44,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-18 18:01:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2023-02-18 18:01:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-18 18:01:44,712 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:01:44,713 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:01:44,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 18:01:44,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:44,918 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:01:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:01:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1562474561, now seen corresponding path program 2 times [2023-02-18 18:01:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:01:44,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161040432] [2023-02-18 18:01:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:01:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:01:44,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:01:44,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538193741] [2023-02-18 18:01:44,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:01:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:44,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:01:44,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:01:45,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 18:01:45,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:01:45,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:01:45,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 18:01:45,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:01:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 109 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-02-18 18:01:45,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:01:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 18:01:45,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:01:45,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161040432] [2023-02-18 18:01:45,110 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:01:45,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538193741] [2023-02-18 18:01:45,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538193741] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:01:45,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:01:45,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2023-02-18 18:01:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573850515] [2023-02-18 18:01:45,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:01:45,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:01:45,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:01:45,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:01:45,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:01:45,112 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-02-18 18:01:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:01:45,146 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2023-02-18 18:01:45,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 18:01:45,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 95 [2023-02-18 18:01:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:01:45,148 INFO L225 Difference]: With dead ends: 126 [2023-02-18 18:01:45,148 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 18:01:45,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:01:45,150 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:01:45,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:01:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 18:01:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 18:01:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 18:01:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 18:01:45,153 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2023-02-18 18:01:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:01:45,153 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 18:01:45,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-02-18 18:01:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 18:01:45,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 18:01:45,156 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 18:01:45,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 18:01:45,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:01:45,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 18:01:45,390 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse5 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~d~0#1| .cse5)) (.cse1 (>= .cse5 0)) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse3 (>= .cse5 1)) (.cse4 (<= .cse5 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| 0) .cse3 .cse4)))) [2023-02-18 18:01:45,390 INFO L899 garLoopResultBuilder]: For program point L48(lines 46 58) no Hoare annotation was computed. [2023-02-18 18:01:45,390 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 63) the Hoare annotation is: true [2023-02-18 18:01:45,390 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse6 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse5 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse0 (<= .cse5 1)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| .cse5)) (.cse3 (>= .cse5 0)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse8 (>= .cse6 0)) (.cse9 (>= .cse6 1)) (.cse10 (let ((.cse13 (* (- 4294967296) (div |ULTIMATE.start_main_~A~0#1| 4294967296)))) (let ((.cse12 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse13)))) (or .cse12 (and (not .cse12) (= (+ |ULTIMATE.start_main_~A~0#1| .cse13 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0)))))) (.cse11 (<= .cse6 1))) (or (let ((.cse2 (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)))) (and .cse0 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (<= 0 .cse2) .cse4 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= .cse5 (+ (* |ULTIMATE.start_main_~q~0#1| .cse6) |ULTIMATE.start_main_~r~0#1|)) .cse7 .cse8 (>= |ULTIMATE.start_main_~r~0#1| .cse6) .cse9 .cse10 (= |ULTIMATE.start_main_~d~0#1| (* .cse6 |ULTIMATE.start_main_~p~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (* 2 1)) .cse11 (<= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse6)) (>= (mod .cse2 4294967296) 1) (< .cse2 4294967296))) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~d~0#1| .cse6) .cse3 (= |ULTIMATE.start_main_~p~0#1| 1) (>= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) .cse4 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse7 .cse8 .cse9 (< |ULTIMATE.start_main_~d~0#1| 4294967296) .cse10 (<= |ULTIMATE.start_main_~d~0#1| .cse6) .cse11)))) [2023-02-18 18:01:45,390 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 18:01:45,391 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-02-18 18:01:45,391 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 18:01:45,393 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (and (<= .cse0 1) (>= .cse0 0))) [2023-02-18 18:01:45,395 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (<= .cse0 1) (>= .cse1 0) (>= .cse0 0) (<= .cse1 1))) [2023-02-18 18:01:45,395 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse6 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse5 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse0 (<= .cse5 1)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| .cse5)) (.cse3 (>= .cse5 0)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse8 (>= .cse6 0)) (.cse9 (>= .cse6 1)) (.cse10 (let ((.cse13 (* (- 4294967296) (div |ULTIMATE.start_main_~A~0#1| 4294967296)))) (let ((.cse12 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse13)))) (or .cse12 (and (not .cse12) (= (+ |ULTIMATE.start_main_~A~0#1| .cse13 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0)))))) (.cse11 (<= .cse6 1))) (or (let ((.cse2 (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)))) (and .cse0 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (<= 0 .cse2) .cse4 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= .cse5 (+ (* |ULTIMATE.start_main_~q~0#1| .cse6) |ULTIMATE.start_main_~r~0#1|)) .cse7 .cse8 (>= |ULTIMATE.start_main_~r~0#1| .cse6) .cse9 .cse10 (= |ULTIMATE.start_main_~d~0#1| (* .cse6 |ULTIMATE.start_main_~p~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (* 2 1)) .cse11 (<= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse6)) (>= (mod .cse2 4294967296) 1) (< .cse2 4294967296))) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~d~0#1| .cse6) .cse3 (= |ULTIMATE.start_main_~p~0#1| 1) (>= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) .cse4 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse7 .cse8 .cse9 (< |ULTIMATE.start_main_~d~0#1| 4294967296) .cse10 (<= |ULTIMATE.start_main_~d~0#1| .cse6) .cse11)))) [2023-02-18 18:01:45,395 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse6 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse5 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse0 (<= .cse5 1)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| .cse5)) (.cse3 (>= .cse5 0)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse8 (>= .cse6 0)) (.cse9 (>= .cse6 1)) (.cse10 (let ((.cse13 (* (- 4294967296) (div |ULTIMATE.start_main_~A~0#1| 4294967296)))) (let ((.cse12 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse13)))) (or .cse12 (and (not .cse12) (= (+ |ULTIMATE.start_main_~A~0#1| .cse13 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0)))))) (.cse11 (<= .cse6 1))) (or (let ((.cse2 (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)))) (and .cse0 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (<= 0 .cse2) .cse4 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= .cse5 (+ (* |ULTIMATE.start_main_~q~0#1| .cse6) |ULTIMATE.start_main_~r~0#1|)) .cse7 .cse8 (>= |ULTIMATE.start_main_~r~0#1| .cse6) .cse9 .cse10 (= |ULTIMATE.start_main_~d~0#1| (* .cse6 |ULTIMATE.start_main_~p~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (* 2 1)) .cse11 (<= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse6)) (>= (mod .cse2 4294967296) 1) (< .cse2 4294967296))) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~d~0#1| .cse6) .cse3 (= |ULTIMATE.start_main_~p~0#1| 1) (>= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) .cse4 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse7 .cse8 .cse9 (< |ULTIMATE.start_main_~d~0#1| 4294967296) .cse10 (<= |ULTIMATE.start_main_~d~0#1| .cse6) .cse11)))) [2023-02-18 18:01:45,395 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 18:01:45,395 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-02-18 18:01:45,396 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 57) no Hoare annotation was computed. [2023-02-18 18:01:45,396 INFO L895 garLoopResultBuilder]: At program point L54-2(lines 46 58) the Hoare annotation is: (let ((.cse7 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse6 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse1 (= |ULTIMATE.start_main_~r~0#1| .cse6)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse0 (<= .cse6 1)) (.cse3 (>= .cse6 0)) (.cse13 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse8 (>= .cse7 0)) (.cse12 (- |ULTIMATE.start_main_~d~0#1|)) (.cse9 (>= .cse7 1)) (.cse10 (= |ULTIMATE.start_main_~d~0#1| (* .cse7 |ULTIMATE.start_main_~p~0#1|))) (.cse11 (<= .cse7 1)) (.cse5 (mod |ULTIMATE.start_main_~d~0#1| 2))) (or (let ((.cse2 (div .cse12 (- 2)))) (and .cse0 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (<= 0 .cse2) .cse4 (= .cse5 0) (= .cse6 (+ (* |ULTIMATE.start_main_~q~0#1| .cse7) |ULTIMATE.start_main_~r~0#1|)) .cse8 (>= |ULTIMATE.start_main_~r~0#1| .cse7) .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| (* 2 1)) .cse11 (<= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse7)) (>= (mod .cse2 4294967296) 1) (< .cse2 4294967296))) (and .cse1 (= |ULTIMATE.start_main_~d~0#1| .cse7) .cse8 .cse13 .cse4 .cse9 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse7) (<= |ULTIMATE.start_main_~d~0#1| .cse7) .cse11) (let ((.cse15 (= 0 .cse5)) (.cse26 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse25 (- (div |ULTIMATE.start_main_~d~0#1| 2)))) (let ((.cse14 (+ 0 |ULTIMATE.start_main_~d~0#1|)) (.cse23 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse22 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse17 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse25))) (.cse18 (not .cse26)) (.cse19 (and .cse26 (not .cse15))) (.cse20 (+ |ULTIMATE.start_main_~r~0#1| .cse25)) (.cse21 (div |ULTIMATE.start_main_~p~0#1| 2))) (and .cse0 (< 0 2) .cse3 .cse13 (>= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= .cse6 (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) .cse7) (+ |ULTIMATE.start_main_~r~0#1| .cse12))) (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1))) 0) (>= .cse6 .cse14) (<= 0 .cse14) (or (let ((.cse16 (* (+ |ULTIMATE.start_main_~q~0#1| (+ 1 .cse21)) .cse7))) (and (or .cse15 (= .cse6 (+ .cse16 .cse17)) .cse18) (or .cse19 (= .cse6 (+ .cse16 .cse20))))) .cse22 (not .cse23)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse6 (- .cse7))) .cse8 (= |ULTIMATE.start_main_~r~0#1| (+ .cse6 .cse12)) .cse9 (>= .cse6 .cse7) (< .cse14 4294967296) .cse10 .cse11 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) (or (and .cse23 (not .cse22)) (let ((.cse24 (* (+ |ULTIMATE.start_main_~q~0#1| .cse21) .cse7))) (and (or (= .cse6 (+ .cse24 .cse17)) .cse15 .cse18) (or .cse19 (= .cse6 (+ .cse24 .cse20)))))))))))) [2023-02-18 18:01:45,396 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse4 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse2 (>= .cse4 0)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse10 (>= .cse4 1)) (.cse5 (<= .cse4 1)) (.cse0 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse12 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0)) (.cse6 (<= .cse0 1)) (.cse1 (let ((.cse30 (= |ULTIMATE.start_main_~d~0#1| .cse4)) (.cse31 (= |ULTIMATE.start_main_~p~0#1| 1))) (or (and .cse30 .cse2 .cse31 .cse10 .cse5) (and .cse30 .cse2 .cse31 .cse3 .cse10 .cse5)))) (.cse8 (>= .cse0 0)) (.cse9 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse7 (let ((.cse22 (= 0 (mod |ULTIMATE.start_main_~d~0#1| 2))) (.cse29 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse28 (- (div |ULTIMATE.start_main_~d~0#1| 2)))) (let ((.cse21 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse28))) (.cse23 (not .cse29)) (.cse24 (and .cse29 (not .cse22))) (.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse28)) (.cse26 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse19 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse18 (< |ULTIMATE.start_main_~p~0#1| 0))) (let ((.cse16 (or (let ((.cse27 (* (+ |ULTIMATE.start_main_~q~0#1| (+ 1 .cse26)) .cse4))) (and (or .cse22 (= .cse0 (+ .cse27 .cse21)) .cse23) (or .cse24 (= .cse0 (+ .cse27 .cse25))))) .cse19 (not .cse18))) (.cse17 (or (and .cse18 (not .cse19)) (let ((.cse20 (* (+ |ULTIMATE.start_main_~q~0#1| .cse26) .cse4))) (and (or (= .cse0 (+ .cse20 .cse21)) .cse22 .cse23) (or .cse24 (= .cse0 (+ .cse20 .cse25))))))) (.cse15 (= .cse0 (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) .cse4) (+ |ULTIMATE.start_main_~r~0#1| .cse9)))) (.cse13 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse14 (= .cse0 (+ (* |ULTIMATE.start_main_~q~0#1| .cse4) |ULTIMATE.start_main_~r~0#1|)))) (or (and .cse6 .cse1 .cse2 .cse8 .cse10 .cse13 .cse14 .cse5) (and .cse6 .cse8 .cse15 .cse13 .cse14 .cse16 (= |ULTIMATE.start_main_~r~0#1| (+ .cse0 (- .cse4))) .cse1 .cse2 .cse10 (>= .cse0 .cse4) .cse5 .cse12 .cse17) (and .cse6 .cse16 .cse1 .cse2 .cse8 .cse10 .cse15 .cse13 .cse14 .cse5 .cse17) (and .cse6 .cse1 .cse2 .cse8 .cse10 .cse15 .cse13 .cse14 .cse5) (and .cse6 .cse1 .cse2 (or (>= |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~d~0#1|)) .cse15 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) .cse8 .cse10 .cse13 .cse14 .cse5))))))) (or (and (= |ULTIMATE.start_main_~r~0#1| .cse0) .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse4) (<= |ULTIMATE.start_main_~d~0#1| .cse4) .cse5) (let ((.cse11 (+ 0 |ULTIMATE.start_main_~d~0#1|))) (and .cse6 .cse7 (< 0 2) .cse8 (= |ULTIMATE.start_main_~r~0#1| (+ .cse0 .cse9)) (>= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) .cse10 (< .cse11 4294967296) (= (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1))) 0) (>= .cse0 .cse11) .cse12 (<= 0 .cse11))) (and .cse6 .cse7 .cse8 .cse10 (= .cse0 (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))))))) [2023-02-18 18:01:45,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 18:01:45,397 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse6 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse5 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse0 (<= .cse5 1)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| .cse5)) (.cse3 (>= .cse5 0)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse8 (>= .cse6 0)) (.cse9 (>= .cse6 1)) (.cse10 (let ((.cse13 (* (- 4294967296) (div |ULTIMATE.start_main_~A~0#1| 4294967296)))) (let ((.cse12 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse13)))) (or .cse12 (and (not .cse12) (= (+ |ULTIMATE.start_main_~A~0#1| .cse13 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0)))))) (.cse11 (<= .cse6 1))) (or (let ((.cse2 (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)))) (and .cse0 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (<= 0 .cse2) .cse4 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= .cse5 (+ (* |ULTIMATE.start_main_~q~0#1| .cse6) |ULTIMATE.start_main_~r~0#1|)) .cse7 .cse8 (>= |ULTIMATE.start_main_~r~0#1| .cse6) .cse9 .cse10 (= |ULTIMATE.start_main_~d~0#1| (* .cse6 |ULTIMATE.start_main_~p~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (* 2 1)) .cse11 (<= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse6)) (>= (mod .cse2 4294967296) 1) (< .cse2 4294967296))) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~d~0#1| .cse6) .cse3 (= |ULTIMATE.start_main_~p~0#1| 1) (>= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) .cse4 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse7 .cse8 .cse9 (< |ULTIMATE.start_main_~d~0#1| 4294967296) .cse10 (<= |ULTIMATE.start_main_~d~0#1| .cse6) .cse11)))) [2023-02-18 18:01:45,397 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2023-02-18 18:01:45,397 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-02-18 18:01:45,398 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse7 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse6 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse1 (= |ULTIMATE.start_main_~r~0#1| .cse6)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse0 (<= .cse6 1)) (.cse3 (>= .cse6 0)) (.cse13 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse8 (>= .cse7 0)) (.cse12 (- |ULTIMATE.start_main_~d~0#1|)) (.cse9 (>= .cse7 1)) (.cse10 (= |ULTIMATE.start_main_~d~0#1| (* .cse7 |ULTIMATE.start_main_~p~0#1|))) (.cse11 (<= .cse7 1)) (.cse5 (mod |ULTIMATE.start_main_~d~0#1| 2))) (or (let ((.cse2 (div .cse12 (- 2)))) (and .cse0 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (<= 0 .cse2) .cse4 (= .cse5 0) (= .cse6 (+ (* |ULTIMATE.start_main_~q~0#1| .cse7) |ULTIMATE.start_main_~r~0#1|)) .cse8 (>= |ULTIMATE.start_main_~r~0#1| .cse7) .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| (* 2 1)) .cse11 (<= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse7)) (>= (mod .cse2 4294967296) 1) (< .cse2 4294967296))) (and .cse1 (= |ULTIMATE.start_main_~d~0#1| .cse7) .cse8 .cse13 .cse4 .cse9 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse7) (<= |ULTIMATE.start_main_~d~0#1| .cse7) .cse11) (let ((.cse15 (= 0 .cse5)) (.cse26 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse25 (- (div |ULTIMATE.start_main_~d~0#1| 2)))) (let ((.cse14 (+ 0 |ULTIMATE.start_main_~d~0#1|)) (.cse23 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse22 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse17 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse25))) (.cse18 (not .cse26)) (.cse19 (and .cse26 (not .cse15))) (.cse20 (+ |ULTIMATE.start_main_~r~0#1| .cse25)) (.cse21 (div |ULTIMATE.start_main_~p~0#1| 2))) (and .cse0 (< 0 2) .cse3 .cse13 (>= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= .cse6 (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) .cse7) (+ |ULTIMATE.start_main_~r~0#1| .cse12))) (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1))) 0) (>= .cse6 .cse14) (<= 0 .cse14) (or (let ((.cse16 (* (+ |ULTIMATE.start_main_~q~0#1| (+ 1 .cse21)) .cse7))) (and (or .cse15 (= .cse6 (+ .cse16 .cse17)) .cse18) (or .cse19 (= .cse6 (+ .cse16 .cse20))))) .cse22 (not .cse23)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse6 (- .cse7))) .cse8 (= |ULTIMATE.start_main_~r~0#1| (+ .cse6 .cse12)) .cse9 (>= .cse6 .cse7) (< .cse14 4294967296) .cse10 .cse11 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) (or (and .cse23 (not .cse22)) (let ((.cse24 (* (+ |ULTIMATE.start_main_~q~0#1| .cse21) .cse7))) (and (or (= .cse6 (+ .cse24 .cse17)) .cse15 .cse18) (or .cse19 (= .cse6 (+ .cse24 .cse20)))))))))))) [2023-02-18 18:01:45,398 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse8 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse14 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse0 (<= .cse14 1)) (.cse3 (>= .cse14 0)) (.cse6 (= .cse14 (+ (* |ULTIMATE.start_main_~q~0#1| .cse8) |ULTIMATE.start_main_~r~0#1|))) (.cse12 (- |ULTIMATE.start_main_~d~0#1|)) (.cse10 (= |ULTIMATE.start_main_~d~0#1| (* .cse8 |ULTIMATE.start_main_~p~0#1|))) (.cse5 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| .cse14)) (.cse7 (>= .cse8 0)) (.cse13 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse9 (>= .cse8 1)) (.cse11 (<= .cse8 1))) (or (let ((.cse2 (div .cse12 (- 2)))) (and .cse0 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (<= 0 .cse2) .cse4 (= .cse5 0) .cse6 .cse7 (>= |ULTIMATE.start_main_~r~0#1| .cse8) .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| (* 2 1)) .cse11 (<= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse8)) (>= (mod .cse2 4294967296) 1) (< .cse2 4294967296))) (let ((.cse16 (= 0 .cse5)) (.cse27 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse26 (- (div |ULTIMATE.start_main_~d~0#1| 2)))) (let ((.cse15 (+ 0 |ULTIMATE.start_main_~d~0#1|)) (.cse24 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse23 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse18 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse26))) (.cse19 (not .cse27)) (.cse20 (and .cse27 (not .cse16))) (.cse21 (+ |ULTIMATE.start_main_~r~0#1| .cse26)) (.cse22 (div |ULTIMATE.start_main_~p~0#1| 2))) (and .cse0 (< 0 2) .cse3 .cse13 (>= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= .cse14 (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) .cse8) (+ |ULTIMATE.start_main_~r~0#1| .cse12))) (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1))) 0) (>= .cse14 .cse15) .cse6 (<= 0 .cse15) (or (let ((.cse17 (* (+ |ULTIMATE.start_main_~q~0#1| (+ 1 .cse22)) .cse8))) (and (or .cse16 (= .cse14 (+ .cse17 .cse18)) .cse19) (or .cse20 (= .cse14 (+ .cse17 .cse21))))) .cse23 (not .cse24)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse14 (- .cse8))) .cse7 (= |ULTIMATE.start_main_~r~0#1| (+ .cse14 .cse12)) .cse9 (>= .cse14 .cse8) (< .cse15 4294967296) .cse10 .cse11 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) (or (and .cse24 (not .cse23)) (let ((.cse25 (* (+ |ULTIMATE.start_main_~q~0#1| .cse22) .cse8))) (and (or (= .cse14 (+ .cse25 .cse18)) .cse16 .cse19) (or .cse20 (= .cse14 (+ .cse25 .cse21))))))))) (and .cse1 (= |ULTIMATE.start_main_~d~0#1| .cse8) .cse7 .cse13 .cse4 .cse9 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse8) (<= |ULTIMATE.start_main_~d~0#1| .cse8) .cse11)))) [2023-02-18 18:01:45,398 INFO L899 garLoopResultBuilder]: For program point L39(lines 36 44) no Hoare annotation was computed. [2023-02-18 18:01:45,398 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-18 18:01:45,398 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-02-18 18:01:45,398 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-02-18 18:01:45,399 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-02-18 18:01:45,399 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 18:01:45,399 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 18:01:45,399 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 18:01:45,399 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 18:01:45,399 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-18 18:01:45,405 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 18:01:45,408 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:01:45,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 18:01:45,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 06:01:45 BoogieIcfgContainer [2023-02-18 18:01:45,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 18:01:45,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 18:01:45,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 18:01:45,455 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 18:01:45,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:01:29" (3/4) ... [2023-02-18 18:01:45,457 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 18:01:45,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 18:01:45,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 18:01:45,480 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 18:01:45,480 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 18:01:45,481 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 18:01:45,481 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 18:01:45,516 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 18:01:45,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 18:01:45,516 INFO L158 Benchmark]: Toolchain (without parser) took 16707.26ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 97.2MB in the beginning and 149.9MB in the end (delta: -52.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-02-18 18:01:45,517 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 18:01:45,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.36ms. Allocated memory is still 140.5MB. Free memory was 96.8MB in the beginning and 86.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 18:01:45,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.52ms. Allocated memory is still 140.5MB. Free memory was 86.3MB in the beginning and 85.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 18:01:45,517 INFO L158 Benchmark]: Boogie Preprocessor took 68.93ms. Allocated memory is still 140.5MB. Free memory was 85.1MB in the beginning and 83.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 18:01:45,517 INFO L158 Benchmark]: RCFGBuilder took 365.95ms. Allocated memory is still 140.5MB. Free memory was 83.8MB in the beginning and 111.7MB in the end (delta: -27.9MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2023-02-18 18:01:45,518 INFO L158 Benchmark]: TraceAbstraction took 15809.20ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 110.9MB in the beginning and 153.0MB in the end (delta: -42.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-02-18 18:01:45,518 INFO L158 Benchmark]: Witness Printer took 61.30ms. Allocated memory is still 205.5MB. Free memory was 153.0MB in the beginning and 149.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 18:01:45,520 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.36ms. Allocated memory is still 140.5MB. Free memory was 96.8MB in the beginning and 86.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.52ms. Allocated memory is still 140.5MB. Free memory was 86.3MB in the beginning and 85.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.93ms. Allocated memory is still 140.5MB. Free memory was 85.1MB in the beginning and 83.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.95ms. Allocated memory is still 140.5MB. Free memory was 83.8MB in the beginning and 111.7MB in the end (delta: -27.9MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15809.20ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 110.9MB in the beginning and 153.0MB in the end (delta: -42.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Witness Printer took 61.30ms. Allocated memory is still 205.5MB. Free memory was 153.0MB in the beginning and 149.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 1162 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 846 mSDsCounter, 209 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1624 IncrementalHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 209 mSolverCounterUnsat, 316 mSDtfsCounter, 1624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 770 GetRequests, 651 SyntacticMatches, 14 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=8, InterpolantAutomatonStates: 84, 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, 9 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 75 PreInvPairs, 100 NumberOfFragments, 4209 HoareAnnotationTreeSize, 75 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 5613 SizeOfPredicates, 27 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 1579/1655 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: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((A % 4294967296 <= 1 && r == A % 4294967296) && r >= -d / -2) && A % 4294967296 >= 0) && 0 <= -d / -2) && q == 0) && d % 2 == 0) && A % 4294967296 == q * (B % 4294967296) + r) && B % 4294967296 >= 0) && r >= B % 4294967296) && B % 4294967296 >= 1) && d == B % 4294967296 * p) && p == 2 * 1) && B % 4294967296 <= 1) && 2 <= p) && d == 2 * (B % 4294967296)) && -d / -2 % 4294967296 >= 1) && -d / -2 < 4294967296) || ((((((((r == A % 4294967296 && d == B % 4294967296) && B % 4294967296 >= 0) && p == 1) && q == 0) && B % 4294967296 >= 1) && r + 1 <= B % 4294967296) && d <= B % 4294967296) && B % 4294967296 <= 1)) || ((((((((((((((((((((A % 4294967296 <= 1 && 0 < 2) && A % 4294967296 >= 0) && p == 1) && d % 4294967296 >= 1) && A % 4294967296 == (q + p) * (B % 4294967296) + (r + -d)) && p >= 1) && q + p * -1 == 0) && A % 4294967296 >= 0 + d) && 0 <= 0 + d) && (((((0 == d % 2 || A % 4294967296 == (q + (1 + p / 2)) * (B % 4294967296) + (r + (-1 + -(d / 2)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A % 4294967296 == (q + (1 + p / 2)) * (B % 4294967296) + (r + -(d / 2)))) || 0 == p % 2) || !(p < 0))) && r == A % 4294967296 + -(B % 4294967296)) && B % 4294967296 >= 0) && r == A % 4294967296 + -d) && B % 4294967296 >= 1) && A % 4294967296 >= B % 4294967296) && 0 + d < 4294967296) && d == B % 4294967296 * p) && B % 4294967296 <= 1) && q + 1 * -1 == 0) && ((p < 0 && !(0 == p % 2)) || (((A % 4294967296 == (q + p / 2) * (B % 4294967296) + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A % 4294967296 == (q + p / 2) * (B % 4294967296) + (r + -(d / 2)))))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((((((((((((A % 4294967296 <= 1 && r == A % 4294967296) && r >= -d / -2) && A % 4294967296 >= 0) && 0 <= -d / -2) && q == 0) && d % 2 == 0) && A % 4294967296 == q * (B % 4294967296) + r) && 0 == q) && B % 4294967296 >= 0) && r >= B % 4294967296) && B % 4294967296 >= 1) && (r == A + -4294967296 * (A / 4294967296) || (!(r == A + -4294967296 * (A / 4294967296)) && A + -4294967296 * (A / 4294967296) + -1 * r == 0))) && d == B % 4294967296 * p) && p == 2 * 1) && B % 4294967296 <= 1) && 2 <= p) && d == 2 * (B % 4294967296)) && -d / -2 % 4294967296 >= 1) && -d / -2 < 4294967296) || (((((((((((((((A % 4294967296 <= 1 && r == A % 4294967296) && 0 <= d) && d == B % 4294967296) && A % 4294967296 >= 0) && p == 1) && d % 4294967296 >= 1) && q == 0) && p >= 1) && 0 == q) && B % 4294967296 >= 0) && B % 4294967296 >= 1) && d < 4294967296) && (r == A + -4294967296 * (A / 4294967296) || (!(r == A + -4294967296 * (A / 4294967296)) && A + -4294967296 * (A / 4294967296) + -1 * r == 0))) && d <= B % 4294967296) && B % 4294967296 <= 1) RESULT: Ultimate proved your program to be correct! [2023-02-18 18:01:45,588 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