./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 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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-?-26d01a9 [2023-02-17 01:59:23,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:59:23,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:59:24,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:59:24,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:59:24,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:59:24,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:59:24,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:59:24,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:59:24,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:59:24,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:59:24,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:59:24,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:59:24,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:59:24,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:59:24,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:59:24,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:59:24,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:59:24,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:59:24,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:59:24,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:59:24,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:59:24,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:59:24,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:59:24,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:59:24,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:59:24,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:59:24,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:59:24,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:59:24,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:59:24,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:59:24,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:59:24,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:59:24,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:59:24,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:59:24,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:59:24,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:59:24,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:59:24,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:59:24,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:59:24,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:59:24,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:59:24,076 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:59:24,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:59:24,076 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:59:24,076 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:59:24,077 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:59:24,077 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:59:24,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:59:24,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:59:24,078 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:59:24,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:59:24,078 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:59:24,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:59:24,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:59:24,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:59:24,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:59:24,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:59:24,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:59:24,079 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:59:24,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:59:24,079 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:59:24,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:59:24,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:59:24,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:59:24,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:59:24,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:59:24,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:59:24,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:59:24,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:59:24,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:59:24,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:59:24,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:59:24,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:59:24,081 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:59:24,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:59:24,081 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:59:24,081 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-17 01:59:24,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:59:24,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:59:24,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:59:24,273 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:59:24,273 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:59:24,274 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-17 01:59:25,437 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:59:25,582 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:59:25,583 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2023-02-17 01:59:25,588 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f961a30d5/d1b0a237ae324350b4e7e70c3c9779a9/FLAG154052c8a [2023-02-17 01:59:25,599 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f961a30d5/d1b0a237ae324350b4e7e70c3c9779a9 [2023-02-17 01:59:25,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:59:25,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:59:25,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:59:25,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:59:25,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:59:25,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a64cbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25, skipping insertion in model container [2023-02-17 01:59:25,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:59:25,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:59:25,728 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-17 01:59:25,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:59:25,747 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:59:25,757 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-17 01:59:25,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:59:25,782 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:59:25,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25 WrapperNode [2023-02-17 01:59:25,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:59:25,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:59:25,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:59:25,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:59:25,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,806 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-02-17 01:59:25,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:59:25,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:59:25,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:59:25,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:59:25,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,819 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:59:25,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:59:25,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:59:25,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:59:25,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (1/1) ... [2023-02-17 01:59:25,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:59:25,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:59:25,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 01:59:25,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 01:59:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:59:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 01:59:25,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 01:59:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:59:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:59:25,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:59:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:59:25,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:59:25,915 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:59:25,917 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:59:26,006 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:59:26,010 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:59:26,011 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 01:59:26,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:59:26 BoogieIcfgContainer [2023-02-17 01:59:26,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:59:26,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:59:26,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:59:26,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:59:26,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:59:25" (1/3) ... [2023-02-17 01:59:26,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416ac1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:59:26, skipping insertion in model container [2023-02-17 01:59:26,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:59:25" (2/3) ... [2023-02-17 01:59:26,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416ac1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:59:26, skipping insertion in model container [2023-02-17 01:59:26,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:59:26" (3/3) ... [2023-02-17 01:59:26,017 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2023-02-17 01:59:26,028 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:59:26,028 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:59:26,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:59:26,060 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;@5e7ffb62, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:59:26,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:59:26,063 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-17 01:59:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 01:59:26,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:59:26,068 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-17 01:59:26,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:59:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:59:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash -487550744, now seen corresponding path program 1 times [2023-02-17 01:59:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:59:26,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633300374] [2023-02-17 01:59:26,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:59:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 01:59:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 01:59:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 01:59:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,187 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-17 01:59:26,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:59:26,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633300374] [2023-02-17 01:59:26,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633300374] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:59:26,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:59:26,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 01:59:26,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150240380] [2023-02-17 01:59:26,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:59:26,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 01:59:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:59:26,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 01:59:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 01:59:26,211 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-17 01:59:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:59:26,226 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2023-02-17 01:59:26,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 01:59:26,227 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-17 01:59:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:59:26,231 INFO L225 Difference]: With dead ends: 63 [2023-02-17 01:59:26,232 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 01:59:26,234 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-17 01:59:26,236 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-17 01:59:26,237 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-17 01:59:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 01:59:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 01:59:26,258 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-17 01:59:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2023-02-17 01:59:26,260 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 24 [2023-02-17 01:59:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:59:26,260 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2023-02-17 01:59:26,260 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-17 01:59:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2023-02-17 01:59:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 01:59:26,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:59:26,261 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-17 01:59:26,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 01:59:26,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:59:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:59:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1636258074, now seen corresponding path program 1 times [2023-02-17 01:59:26,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:59:26,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682689529] [2023-02-17 01:59:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:26,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:59:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 01:59:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 01:59:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 01:59:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,396 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-17 01:59:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:59:26,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682689529] [2023-02-17 01:59:26,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682689529] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:59:26,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:59:26,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 01:59:26,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321270540] [2023-02-17 01:59:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:59:26,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:59:26,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:59:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:59:26,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:59:26,399 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-17 01:59:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:59:26,437 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2023-02-17 01:59:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:59:26,438 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-17 01:59:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:59:26,439 INFO L225 Difference]: With dead ends: 42 [2023-02-17 01:59:26,439 INFO L226 Difference]: Without dead ends: 40 [2023-02-17 01:59:26,439 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-17 01:59:26,440 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-17 01:59:26,441 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-17 01:59:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-17 01:59:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2023-02-17 01:59:26,455 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-17 01:59:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-02-17 01:59:26,457 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 24 [2023-02-17 01:59:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:59:26,457 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-02-17 01:59:26,457 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-17 01:59:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-02-17 01:59:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 01:59:26,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:59:26,458 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-17 01:59:26,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 01:59:26,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:59:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:59:26,459 INFO L85 PathProgramCache]: Analyzing trace with hash 906849917, now seen corresponding path program 1 times [2023-02-17 01:59:26,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:59:26,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251848426] [2023-02-17 01:59:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:59:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 01:59:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 01:59:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 01:59:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 01:59:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,646 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-17 01:59:26,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:59:26,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251848426] [2023-02-17 01:59:26,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251848426] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:59:26,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:59:26,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 01:59:26,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210789462] [2023-02-17 01:59:26,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:59:26,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:59:26,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:59:26,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:59:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:59:26,649 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-17 01:59:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:59:26,700 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2023-02-17 01:59:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:59:26,701 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-17 01:59:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:59:26,702 INFO L225 Difference]: With dead ends: 46 [2023-02-17 01:59:26,702 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 01:59:26,702 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-17 01:59:26,703 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-17 01:59:26,704 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-17 01:59:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 01:59:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-02-17 01:59:26,710 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-17 01:59:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-02-17 01:59:26,711 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 29 [2023-02-17 01:59:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:59:26,711 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-02-17 01:59:26,711 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-17 01:59:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-02-17 01:59:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 01:59:26,712 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:59:26,712 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-17 01:59:26,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 01:59:26,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:59:26,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:59:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 710995206, now seen corresponding path program 1 times [2023-02-17 01:59:26,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:59:26,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348262917] [2023-02-17 01:59:26,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:59:26,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:59:26,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766847035] [2023-02-17 01:59:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:26,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:59:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:59:26,726 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:59:26,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 01:59:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:26,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 01:59:26,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:59:27,003 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-17 01:59:27,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:59:27,335 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-17 01:59:27,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:59:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348262917] [2023-02-17 01:59:27,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:59:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766847035] [2023-02-17 01:59:27,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766847035] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:59:27,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:59:27,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2023-02-17 01:59:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071026529] [2023-02-17 01:59:27,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:59:27,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 01:59:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:59:27,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 01:59:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-17 01:59:27,346 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-17 01:59:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:59:27,619 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2023-02-17 01:59:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 01:59:27,620 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-17 01:59:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:59:27,624 INFO L225 Difference]: With dead ends: 69 [2023-02-17 01:59:27,625 INFO L226 Difference]: Without dead ends: 54 [2023-02-17 01:59:27,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-02-17 01:59:27,631 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-17 01:59:27,632 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-17 01:59:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-17 01:59:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-02-17 01:59:27,647 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-17 01:59:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-02-17 01:59:27,649 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 34 [2023-02-17 01:59:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:59:27,649 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-02-17 01:59:27,650 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-17 01:59:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-02-17 01:59:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 01:59:27,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:59:27,654 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-17 01:59:27,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 01:59:27,859 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-17 01:59:27,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:59:27,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:59:27,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1829555286, now seen corresponding path program 1 times [2023-02-17 01:59:27,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:59:27,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843701630] [2023-02-17 01:59:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:27,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:59:27,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:59:27,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658319233] [2023-02-17 01:59:27,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:27,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:59:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:59:27,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:59:27,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 01:59:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:27,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 01:59:27,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:59:28,002 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-17 01:59:28,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:59:28,172 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-17 01:59:28,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:59:28,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843701630] [2023-02-17 01:59:28,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:59:28,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658319233] [2023-02-17 01:59:28,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658319233] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:59:28,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:59:28,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-02-17 01:59:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290204377] [2023-02-17 01:59:28,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:59:28,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 01:59:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:59:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 01:59:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-17 01:59:28,178 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-17 01:59:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:59:28,580 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2023-02-17 01:59:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 01:59:28,580 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-17 01:59:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:59:28,582 INFO L225 Difference]: With dead ends: 66 [2023-02-17 01:59:28,582 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 01:59:28,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-02-17 01:59:28,583 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:59:28,583 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.3s Time] [2023-02-17 01:59:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 01:59:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-17 01:59:28,598 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-17 01:59:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-02-17 01:59:28,601 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 41 [2023-02-17 01:59:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:59:28,603 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-02-17 01:59:28,603 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-17 01:59:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-02-17 01:59:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-17 01:59:28,605 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:59:28,606 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-17 01:59:28,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 01:59:28,810 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-17 01:59:28,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:59:28,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:59:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash -677073599, now seen corresponding path program 1 times [2023-02-17 01:59:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:59:28,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574710638] [2023-02-17 01:59:28,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:59:28,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:59:28,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578276026] [2023-02-17 01:59:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:28,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:59:28,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:59:28,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:59:28,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 01:59:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:28,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 01:59:28,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:59:28,887 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-17 01:59:28,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:59:28,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:59:28,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574710638] [2023-02-17 01:59:28,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:59:28,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578276026] [2023-02-17 01:59:28,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578276026] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:59:28,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:59:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 01:59:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452348238] [2023-02-17 01:59:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:59:28,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 01:59:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:59:28,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 01:59:28,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 01:59:28,889 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-17 01:59:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:59:28,933 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-02-17 01:59:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 01:59:28,934 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-17 01:59:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:59:28,936 INFO L225 Difference]: With dead ends: 70 [2023-02-17 01:59:28,936 INFO L226 Difference]: Without dead ends: 63 [2023-02-17 01:59:28,937 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-17 01:59:28,937 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-17 01:59:28,938 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-17 01:59:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-17 01:59:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-17 01:59:28,958 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-17 01:59:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-02-17 01:59:28,961 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 69 [2023-02-17 01:59:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:59:28,962 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-02-17 01:59:28,962 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-17 01:59:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-02-17 01:59:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-17 01:59:28,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:59:28,966 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-17 01:59:28,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 01:59:29,171 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-17 01:59:29,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:59:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:59:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1754894755, now seen corresponding path program 1 times [2023-02-17 01:59:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:59:29,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350199126] [2023-02-17 01:59:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:59:29,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:59:29,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401914929] [2023-02-17 01:59:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:29,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:59:29,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:59:29,181 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:59:29,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 01:59:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:29,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-17 01:59:29,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:59:29,410 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-17 01:59:29,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:59:30,232 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-17 01:59:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:59:30,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350199126] [2023-02-17 01:59:30,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:59:30,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401914929] [2023-02-17 01:59:30,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401914929] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:59:30,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:59:30,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-02-17 01:59:30,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532204577] [2023-02-17 01:59:30,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:59:30,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 01:59:30,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:59:30,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 01:59:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-02-17 01:59:30,236 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-17 01:59:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:59:34,556 INFO L93 Difference]: Finished difference Result 145 states and 178 transitions. [2023-02-17 01:59:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 01:59:34,558 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-17 01:59:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:59:34,560 INFO L225 Difference]: With dead ends: 145 [2023-02-17 01:59:34,560 INFO L226 Difference]: Without dead ends: 106 [2023-02-17 01:59:34,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2023-02-17 01:59:34,561 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-17 01:59:34,561 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-17 01:59:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-17 01:59:34,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2023-02-17 01:59:34,625 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-17 01:59:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2023-02-17 01:59:34,628 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 71 [2023-02-17 01:59:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:59:34,628 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2023-02-17 01:59:34,629 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-17 01:59:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2023-02-17 01:59:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-02-17 01:59:34,631 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:59:34,631 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-17 01:59:34,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 01:59:34,836 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-17 01:59:34,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:59:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:59:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1620227847, now seen corresponding path program 1 times [2023-02-17 01:59:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:59:34,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508260532] [2023-02-17 01:59:34,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:59:34,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:59:34,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737098412] [2023-02-17 01:59:34,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:59:34,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:59:34,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:59:34,862 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:59:34,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 01:59:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:59:34,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-17 01:59:34,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:59:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 49 proven. 13 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-02-17 01:59:36,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:59:36,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:59:36,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508260532] [2023-02-17 01:59:36,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:59:36,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737098412] [2023-02-17 01:59:36,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737098412] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:59:36,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:59:36,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2023-02-17 01:59:36,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11747174] [2023-02-17 01:59:36,833 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:59:36,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 01:59:36,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:59:36,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 01:59:36,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-02-17 01:59:36,835 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-17 01:59:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:59:37,404 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2023-02-17 01:59:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 01:59:37,405 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 82 [2023-02-17 01:59:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:59:37,406 INFO L225 Difference]: With dead ends: 117 [2023-02-17 01:59:37,406 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 01:59:37,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2023-02-17 01:59:37,407 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 01:59:37,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 114 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 01:59:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 01:59:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 01:59:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:59:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 01:59:37,407 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2023-02-17 01:59:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:59:37,408 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 01:59:37,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-17 01:59:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 01:59:37,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 01:59:37,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:59:37,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 01:59:37,616 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-17 01:59:37,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 01:59:37,628 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 (>= .cse5 0)) (.cse1 (<= .cse5 1)) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~d~0#1| .cse5)) (.cse4 (>= .cse5 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~q~0#1| 0) .cse4)))) [2023-02-17 01:59:37,629 INFO L899 garLoopResultBuilder]: For program point L48(lines 46 58) no Hoare annotation was computed. [2023-02-17 01:59:37,629 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 63) the Hoare annotation is: true [2023-02-17 01:59:37,629 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse10 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse4 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse0 (>= .cse4 0)) (.cse1 (>= .cse10 0)) (.cse2 (<= .cse4 1)) (.cse3 (let ((.cse12 (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) (- 4294967296)))) (let ((.cse11 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse12)))) (or .cse11 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1| .cse12) 0) (not .cse11)))))) (.cse5 (<= .cse10 1)) (.cse6 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (>= .cse4 1)) (.cse8 (= |ULTIMATE.start_main_~r~0#1| .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse4) .cse5 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse6 .cse7 .cse8 (>= .cse4 |ULTIMATE.start_main_~d~0#1|)) (let ((.cse9 (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)))) (and .cse0 .cse1 .cse2 .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse9) .cse5 (= (* 2 .cse4) |ULTIMATE.start_main_~d~0#1|) (<= 2 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse4) .cse6 (= (* |ULTIMATE.start_main_~p~0#1| .cse4) |ULTIMATE.start_main_~d~0#1|) .cse7 (>= .cse4 .cse9) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse4) |ULTIMATE.start_main_~r~0#1|) .cse10) .cse8 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= |ULTIMATE.start_main_~p~0#1| (* 2 1))))))) [2023-02-17 01:59:37,629 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 01:59:37,629 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-02-17 01:59:37,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 01:59:37,629 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 0) (<= .cse0 1))) [2023-02-17 01:59:37,629 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse1 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (and (>= .cse0 0) (>= .cse1 0) (<= .cse0 1) (<= .cse1 1))) [2023-02-17 01:59:37,630 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse10 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse4 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse0 (>= .cse4 0)) (.cse1 (>= .cse10 0)) (.cse2 (<= .cse4 1)) (.cse3 (let ((.cse12 (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) (- 4294967296)))) (let ((.cse11 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse12)))) (or .cse11 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1| .cse12) 0) (not .cse11)))))) (.cse5 (<= .cse10 1)) (.cse6 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (>= .cse4 1)) (.cse8 (= |ULTIMATE.start_main_~r~0#1| .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse4) .cse5 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse6 .cse7 .cse8 (>= .cse4 |ULTIMATE.start_main_~d~0#1|)) (let ((.cse9 (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)))) (and .cse0 .cse1 .cse2 .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse9) .cse5 (= (* 2 .cse4) |ULTIMATE.start_main_~d~0#1|) (<= 2 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse4) .cse6 (= (* |ULTIMATE.start_main_~p~0#1| .cse4) |ULTIMATE.start_main_~d~0#1|) .cse7 (>= .cse4 .cse9) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse4) |ULTIMATE.start_main_~r~0#1|) .cse10) .cse8 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= |ULTIMATE.start_main_~p~0#1| (* 2 1))))))) [2023-02-17 01:59:37,630 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse10 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse4 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse0 (>= .cse4 0)) (.cse1 (>= .cse10 0)) (.cse2 (<= .cse4 1)) (.cse3 (let ((.cse12 (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) (- 4294967296)))) (let ((.cse11 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse12)))) (or .cse11 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1| .cse12) 0) (not .cse11)))))) (.cse5 (<= .cse10 1)) (.cse6 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (>= .cse4 1)) (.cse8 (= |ULTIMATE.start_main_~r~0#1| .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse4) .cse5 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse6 .cse7 .cse8 (>= .cse4 |ULTIMATE.start_main_~d~0#1|)) (let ((.cse9 (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)))) (and .cse0 .cse1 .cse2 .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse9) .cse5 (= (* 2 .cse4) |ULTIMATE.start_main_~d~0#1|) (<= 2 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse4) .cse6 (= (* |ULTIMATE.start_main_~p~0#1| .cse4) |ULTIMATE.start_main_~d~0#1|) .cse7 (>= .cse4 .cse9) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse4) |ULTIMATE.start_main_~r~0#1|) .cse10) .cse8 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= |ULTIMATE.start_main_~p~0#1| (* 2 1))))))) [2023-02-17 01:59:37,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 01:59:37,630 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-02-17 01:59:37,630 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 57) no Hoare annotation was computed. [2023-02-17 01:59:37,631 INFO L895 garLoopResultBuilder]: At program point L54-2(lines 46 58) the Hoare annotation is: (let ((.cse2 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse11 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| .cse11)) (.cse0 (>= .cse2 0)) (.cse6 (>= .cse11 0)) (.cse1 (<= .cse2 1)) (.cse13 (- |ULTIMATE.start_main_~d~0#1|)) (.cse9 (* 2 .cse2)) (.cse8 (<= .cse11 1)) (.cse10 (= (* |ULTIMATE.start_main_~p~0#1| .cse2) |ULTIMATE.start_main_~d~0#1|)) (.cse4 (>= .cse2 1)) (.cse12 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse2) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse2) (>= .cse2 |ULTIMATE.start_main_~d~0#1|)) (let ((.cse7 (div .cse13 (- 2)))) (and .cse0 .cse6 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse7) .cse8 (= .cse9 |ULTIMATE.start_main_~d~0#1|) (<= 2 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) .cse10 .cse4 (>= .cse2 .cse7) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse2) |ULTIMATE.start_main_~r~0#1|) .cse11) .cse5 .cse12 (= |ULTIMATE.start_main_~p~0#1| (* 2 1)))) (let ((.cse25 (- (div |ULTIMATE.start_main_~d~0#1| 2))) (.cse26 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse14 (+ |ULTIMATE.start_main_~r~0#1| .cse2)) (.cse23 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse22 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse20 (and (not .cse12) .cse26)) (.cse19 (+ |ULTIMATE.start_main_~r~0#1| .cse25)) (.cse16 (not .cse26)) (.cse17 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse25))) (.cse21 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse15 (+ .cse11 1))) (and (= (+ (+ |ULTIMATE.start_main_~r~0#1| .cse13) (* (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) .cse2)) .cse11) .cse0 .cse6 .cse1 (= .cse14 .cse11) (>= .cse11 |ULTIMATE.start_main_~d~0#1|) (<= |ULTIMATE.start_main_~r~0#1| (+ .cse11 .cse13)) (<= .cse15 .cse9) (< 0 2) .cse8 (<= .cse15 (* 2 |ULTIMATE.start_main_~d~0#1|)) (>= |ULTIMATE.start_main_~p~0#1| 1) (or (let ((.cse18 (* (+ |ULTIMATE.start_main_~q~0#1| .cse21) .cse2))) (and (or .cse16 (= (+ .cse17 .cse18) .cse11) .cse12) (or (= (+ .cse18 .cse19) .cse11) .cse20))) (and .cse22 (not .cse23))) (>= .cse14 .cse2) .cse10 .cse4 (or .cse23 (not .cse22) (let ((.cse24 (* (+ |ULTIMATE.start_main_~q~0#1| (+ .cse21 1)) .cse2))) (and (or .cse20 (= .cse11 (+ .cse24 .cse19))) (or .cse16 (= (+ .cse17 .cse24) .cse11) .cse12)))) (= (+ |ULTIMATE.start_main_~q~0#1| (* (- 1) 1)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (<= .cse15 (* 2 .cse11)))))))) [2023-02-17 01:59:37,631 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse5 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse0 (>= .cse5 0)) (.cse1 (<= .cse5 1)) (.cse34 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (>= .cse5 1))) (let ((.cse15 (let ((.cse35 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse36 (= |ULTIMATE.start_main_~d~0#1| .cse5))) (or (and .cse0 .cse1 .cse35 .cse36 .cse7) (and .cse0 .cse1 .cse35 .cse36 .cse34 .cse7)))) (.cse2 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (or (let ((.cse4 (+ .cse2 1)) (.cse8 (= (+ |ULTIMATE.start_main_~q~0#1| (* (- 1) 1)) 0)) (.cse6 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse3 (- |ULTIMATE.start_main_~d~0#1|))) (and .cse0 .cse1 (>= .cse2 |ULTIMATE.start_main_~d~0#1|) (<= |ULTIMATE.start_main_~r~0#1| (+ .cse2 .cse3)) (<= .cse4 (* 2 .cse5)) (< 0 2) (<= .cse4 .cse6) .cse7 .cse8 (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~B~0#1_45_56| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| Int) (|aux_div_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| Int)) (let ((.cse10 (+ |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| (* |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| 4294967296)))) (let ((.cse11 (+ (* |aux_div_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78| 4294967296) .cse10))) (let ((.cse12 (+ (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 4294967296) .cse11))) (let ((.cse9 (+ .cse12 (* |aux_div_aux_mod_ULTIMATE.start_main_~B~0#1_45_56| 4294967296)))) (and (<= 0 .cse9) (<= .cse10 1) (= (+ |ULTIMATE.start_main_~r~0#1| (* |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| |ULTIMATE.start_main_~q~0#1|)) .cse2) (<= 0 .cse10) (< .cse10 4294967296) (< .cse9 4294967296) (< .cse11 4294967296) (< .cse12 4294967296) (< |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| 4294967296) (<= 0 .cse12) (>= .cse11 1) (<= 0 .cse11) (<= .cse4 (* 2 .cse12)) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89|))))))) (<= .cse4 (* 2 .cse2)) (let ((.cse29 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse33 (- (div |ULTIMATE.start_main_~d~0#1| 2))) (.cse32 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse27 (not .cse32)) (.cse28 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse33))) (.cse26 (+ |ULTIMATE.start_main_~r~0#1| .cse33)) (.cse24 (and (not .cse29) .cse32)) (.cse30 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse23 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse22 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse20 (or (let ((.cse31 (* (+ |ULTIMATE.start_main_~q~0#1| .cse30) .cse5))) (and (or .cse27 (= (+ .cse28 .cse31) .cse2) .cse29) (or (= (+ .cse31 .cse26) .cse2) .cse24))) (and .cse23 (not .cse22)))) (.cse21 (or .cse22 (not .cse23) (let ((.cse25 (* (+ |ULTIMATE.start_main_~q~0#1| (+ .cse30 1)) .cse5))) (and (or .cse24 (= .cse2 (+ .cse25 .cse26))) (or .cse27 (= (+ .cse28 .cse25) .cse2) .cse29))))) (.cse14 (>= .cse2 0)) (.cse16 (<= .cse2 1)) (.cse17 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse13 (= (+ (+ |ULTIMATE.start_main_~r~0#1| .cse3) (* (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) .cse5)) .cse2)) (.cse18 (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse5) |ULTIMATE.start_main_~r~0#1|) .cse2))) (or (and .cse13 .cse0 .cse14 .cse1 .cse15 .cse16 .cse17 .cse7 .cse18) (let ((.cse19 (+ |ULTIMATE.start_main_~r~0#1| .cse5))) (and .cse13 .cse0 .cse14 .cse1 (= .cse19 .cse2) .cse15 .cse16 .cse17 .cse20 (>= .cse19 .cse5) .cse7 .cse18 .cse21 .cse8)) (and .cse0 .cse14 .cse1 .cse15 .cse16 .cse17 .cse7 .cse18) (and .cse13 .cse0 .cse14 .cse1 .cse15 .cse16 .cse17 .cse20 .cse7 .cse18 .cse21) (and .cse0 .cse14 .cse1 .cse15 .cse16 .cse17 (or .cse13 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (>= |ULTIMATE.start_main_~r~0#1| .cse6)) .cse7 .cse18))))))) (and .cse0 .cse1 .cse15 .cse34 (= |ULTIMATE.start_main_~r~0#1| .cse2) (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse5) (>= .cse5 |ULTIMATE.start_main_~d~0#1|)))))) [2023-02-17 01:59:37,631 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 01:59:37,632 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse10 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse4 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse0 (>= .cse4 0)) (.cse1 (>= .cse10 0)) (.cse2 (<= .cse4 1)) (.cse3 (let ((.cse12 (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) (- 4294967296)))) (let ((.cse11 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse12)))) (or .cse11 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1| .cse12) 0) (not .cse11)))))) (.cse5 (<= .cse10 1)) (.cse6 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse7 (>= .cse4 1)) (.cse8 (= |ULTIMATE.start_main_~r~0#1| .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse4) .cse5 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse6 .cse7 .cse8 (>= .cse4 |ULTIMATE.start_main_~d~0#1|)) (let ((.cse9 (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)))) (and .cse0 .cse1 .cse2 .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse9) .cse5 (= (* 2 .cse4) |ULTIMATE.start_main_~d~0#1|) (<= 2 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse4) .cse6 (= (* |ULTIMATE.start_main_~p~0#1| .cse4) |ULTIMATE.start_main_~d~0#1|) .cse7 (>= .cse4 .cse9) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse4) |ULTIMATE.start_main_~r~0#1|) .cse10) .cse8 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= |ULTIMATE.start_main_~p~0#1| (* 2 1))))))) [2023-02-17 01:59:37,632 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2023-02-17 01:59:37,632 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-02-17 01:59:37,633 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse2 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse11 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| .cse11)) (.cse0 (>= .cse2 0)) (.cse6 (>= .cse11 0)) (.cse1 (<= .cse2 1)) (.cse13 (- |ULTIMATE.start_main_~d~0#1|)) (.cse9 (* 2 .cse2)) (.cse8 (<= .cse11 1)) (.cse10 (= (* |ULTIMATE.start_main_~p~0#1| .cse2) |ULTIMATE.start_main_~d~0#1|)) (.cse4 (>= .cse2 1)) (.cse12 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse2) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse2) (>= .cse2 |ULTIMATE.start_main_~d~0#1|)) (let ((.cse7 (div .cse13 (- 2)))) (and .cse0 .cse6 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse7) .cse8 (= .cse9 |ULTIMATE.start_main_~d~0#1|) (<= 2 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) .cse10 .cse4 (>= .cse2 .cse7) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse2) |ULTIMATE.start_main_~r~0#1|) .cse11) .cse5 .cse12 (= |ULTIMATE.start_main_~p~0#1| (* 2 1)))) (let ((.cse25 (- (div |ULTIMATE.start_main_~d~0#1| 2))) (.cse26 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse14 (+ |ULTIMATE.start_main_~r~0#1| .cse2)) (.cse23 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse22 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse20 (and (not .cse12) .cse26)) (.cse19 (+ |ULTIMATE.start_main_~r~0#1| .cse25)) (.cse16 (not .cse26)) (.cse17 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse25))) (.cse21 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse15 (+ .cse11 1))) (and (= (+ (+ |ULTIMATE.start_main_~r~0#1| .cse13) (* (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) .cse2)) .cse11) .cse0 .cse6 .cse1 (= .cse14 .cse11) (>= .cse11 |ULTIMATE.start_main_~d~0#1|) (<= |ULTIMATE.start_main_~r~0#1| (+ .cse11 .cse13)) (<= .cse15 .cse9) (< 0 2) .cse8 (<= .cse15 (* 2 |ULTIMATE.start_main_~d~0#1|)) (>= |ULTIMATE.start_main_~p~0#1| 1) (or (let ((.cse18 (* (+ |ULTIMATE.start_main_~q~0#1| .cse21) .cse2))) (and (or .cse16 (= (+ .cse17 .cse18) .cse11) .cse12) (or (= (+ .cse18 .cse19) .cse11) .cse20))) (and .cse22 (not .cse23))) (>= .cse14 .cse2) .cse10 .cse4 (or .cse23 (not .cse22) (let ((.cse24 (* (+ |ULTIMATE.start_main_~q~0#1| (+ .cse21 1)) .cse2))) (and (or .cse20 (= .cse11 (+ .cse24 .cse19))) (or .cse16 (= (+ .cse17 .cse24) .cse11) .cse12)))) (= (+ |ULTIMATE.start_main_~q~0#1| (* (- 1) 1)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (<= .cse15 (* 2 .cse11)))))))) [2023-02-17 01:59:37,633 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse7 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse2 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse0 (>= .cse2 0)) (.cse8 (>= .cse7 0)) (.cse1 (<= .cse2 1)) (.cse12 (<= .cse7 1)) (.cse11 (* 2 .cse2)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse22 (= (* |ULTIMATE.start_main_~p~0#1| .cse2) |ULTIMATE.start_main_~d~0#1|)) (.cse4 (>= .cse2 1)) (.cse23 (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse2) |ULTIMATE.start_main_~r~0#1|) .cse7)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| .cse7)) (.cse16 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse6 (- |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse2) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse2) (>= .cse2 |ULTIMATE.start_main_~d~0#1|)) (let ((.cse29 (- (div |ULTIMATE.start_main_~d~0#1| 2))) (.cse30 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse9 (+ |ULTIMATE.start_main_~r~0#1| .cse2)) (.cse21 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse20 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse18 (and (not .cse16) .cse30)) (.cse17 (+ |ULTIMATE.start_main_~r~0#1| .cse29)) (.cse13 (not .cse30)) (.cse14 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse29))) (.cse19 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse10 (+ .cse7 1))) (and (= (+ (+ |ULTIMATE.start_main_~r~0#1| .cse6) (* (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) .cse2)) .cse7) .cse0 .cse8 .cse1 (= .cse9 .cse7) (>= .cse7 |ULTIMATE.start_main_~d~0#1|) (<= |ULTIMATE.start_main_~r~0#1| (+ .cse7 .cse6)) (<= .cse10 .cse11) (< 0 2) .cse12 (<= .cse10 (* 2 |ULTIMATE.start_main_~d~0#1|)) (>= |ULTIMATE.start_main_~p~0#1| 1) (or (let ((.cse15 (* (+ |ULTIMATE.start_main_~q~0#1| .cse19) .cse2))) (and (or .cse13 (= (+ .cse14 .cse15) .cse7) .cse16) (or (= (+ .cse15 .cse17) .cse7) .cse18))) (and .cse20 (not .cse21))) (>= .cse9 .cse2) .cse22 .cse4 .cse23 (or .cse21 (not .cse20) (let ((.cse24 (* (+ |ULTIMATE.start_main_~q~0#1| (+ .cse19 1)) .cse2))) (and (or .cse18 (= .cse7 (+ .cse24 .cse17))) (or .cse13 (= (+ .cse14 .cse24) .cse7) .cse16)))) (= (+ |ULTIMATE.start_main_~q~0#1| (* (- 1) 1)) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~B~0#1_45_56| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| Int) (|aux_div_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| Int)) (let ((.cse26 (+ |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| (* |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| 4294967296)))) (let ((.cse27 (+ (* |aux_div_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78| 4294967296) .cse26))) (let ((.cse28 (+ (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 4294967296) .cse27))) (let ((.cse25 (+ .cse28 (* |aux_div_aux_mod_ULTIMATE.start_main_~B~0#1_45_56| 4294967296)))) (and (<= 0 .cse25) (<= .cse26 1) (= (+ |ULTIMATE.start_main_~r~0#1| (* |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| |ULTIMATE.start_main_~q~0#1|)) .cse7) (<= 0 .cse26) (< .cse26 4294967296) (< .cse25 4294967296) (< .cse27 4294967296) (< .cse28 4294967296) (< |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89| 4294967296) (<= 0 .cse28) (>= .cse27 1) (<= 0 .cse27) (<= .cse10 (* 2 .cse28)) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67_78_89|))))))) (<= .cse10 (* 2 .cse7))))) (let ((.cse31 (div .cse6 (- 2)))) (and .cse0 .cse8 .cse1 (>= |ULTIMATE.start_main_~r~0#1| .cse31) .cse12 (= .cse11 |ULTIMATE.start_main_~d~0#1|) (<= 2 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) .cse22 .cse4 (>= .cse2 .cse31) .cse23 .cse5 .cse16 (= |ULTIMATE.start_main_~p~0#1| (* 2 1))))))) [2023-02-17 01:59:37,633 INFO L899 garLoopResultBuilder]: For program point L39(lines 36 44) no Hoare annotation was computed. [2023-02-17 01:59:37,633 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-17 01:59:37,633 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-02-17 01:59:37,635 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-02-17 01:59:37,636 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-02-17 01:59:37,636 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 01:59:37,636 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 01:59:37,636 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 01:59:37,636 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 01:59:37,636 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-17 01:59:37,636 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 01:59:37,639 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:59:37,641 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:59:37,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:59:37 BoogieIcfgContainer [2023-02-17 01:59:37,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:59:37,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:59:37,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:59:37,673 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:59:37,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:59:26" (3/4) ... [2023-02-17 01:59:37,675 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 01:59:37,679 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-17 01:59:37,679 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 01:59:37,682 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-17 01:59:37,683 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 01:59:37,683 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 01:59:37,683 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 01:59:37,707 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:59:37,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:59:37,708 INFO L158 Benchmark]: Toolchain (without parser) took 12105.53ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 156.1MB in the beginning and 273.9MB in the end (delta: -117.8MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2023-02-17 01:59:37,708 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory was 161.5MB in the beginning and 161.5MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:59:37,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.29ms. Allocated memory is still 201.3MB. Free memory was 156.1MB in the beginning and 145.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:59:37,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.12ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:59:37,709 INFO L158 Benchmark]: Boogie Preprocessor took 13.95ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 142.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:59:37,709 INFO L158 Benchmark]: RCFGBuilder took 190.75ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 132.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:59:37,710 INFO L158 Benchmark]: TraceAbstraction took 11659.03ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 131.0MB in the beginning and 277.1MB in the end (delta: -146.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:59:37,710 INFO L158 Benchmark]: Witness Printer took 34.84ms. Allocated memory is still 335.5MB. Free memory was 277.1MB in the beginning and 273.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:59:37,712 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 201.3MB. Free memory was 161.5MB in the beginning and 161.5MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.29ms. Allocated memory is still 201.3MB. Free memory was 156.1MB in the beginning and 145.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.12ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.95ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 142.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 190.75ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 132.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11659.03ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 131.0MB in the beginning and 277.1MB in the end (delta: -146.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 34.84ms. Allocated memory is still 335.5MB. Free memory was 277.1MB in the beginning and 273.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.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: 11.6s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 907 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 652 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1529 IncrementalHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 255 mSDtfsCounter, 1529 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 406 SyntacticMatches, 8 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=7, InterpolantAutomatonStates: 78, 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, 8 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 68 PreInvPairs, 92 NumberOfFragments, 3550 HoareAnnotationTreeSize, 68 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 509 ConstructedInterpolants, 3 QuantifiedInterpolants, 4825 SizeOfPredicates, 27 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 743/798 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: (((((((((B % 4294967296 >= 0 && B % 4294967296 <= 1) && p == 1) && d == B % 4294967296) && q == 0) && B % 4294967296 >= 1) && r == A % 4294967296) && r + 1 <= B % 4294967296) && B % 4294967296 >= d) || ((((((((((((((((B % 4294967296 >= 0 && A % 4294967296 >= 0) && B % 4294967296 <= 1) && r >= -d / -2) && A % 4294967296 <= 1) && 2 * (B % 4294967296) == d) && 2 <= p) && r >= B % 4294967296) && q == 0) && !(r >= d)) && p * (B % 4294967296) == d) && B % 4294967296 >= 1) && B % 4294967296 >= -d / -2) && q * (B % 4294967296) + r == A % 4294967296) && r == A % 4294967296) && d % 2 == 0) && p == 2 * 1)) || (((((((((((((((((((r + -d + (p + q) * (B % 4294967296) == A % 4294967296 && B % 4294967296 >= 0) && A % 4294967296 >= 0) && B % 4294967296 <= 1) && r + B % 4294967296 == A % 4294967296) && A % 4294967296 >= d) && r <= A % 4294967296 + -d) && A % 4294967296 + 1 <= 2 * (B % 4294967296)) && 0 < 2) && A % 4294967296 <= 1) && A % 4294967296 + 1 <= 2 * d) && p >= 1) && ((((!(d < 0) || r + (-1 + -(d / 2)) + (q + p / 2) * (B % 4294967296) == A % 4294967296) || d % 2 == 0) && ((q + p / 2) * (B % 4294967296) + (r + -(d / 2)) == A % 4294967296 || (!(d % 2 == 0) && d < 0))) || (p < 0 && !(p % 2 == 0)))) && r + B % 4294967296 >= B % 4294967296) && p * (B % 4294967296) == d) && B % 4294967296 >= 1) && ((p % 2 == 0 || !(p < 0)) || (((!(d % 2 == 0) && d < 0) || A % 4294967296 == (q + (p / 2 + 1)) * (B % 4294967296) + (r + -(d / 2))) && ((!(d < 0) || r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B % 4294967296) == A % 4294967296) || d % 2 == 0)))) && q + -1 * 1 == 0) && -1 * p + q == 0) && A % 4294967296 + 1 <= 2 * (A % 4294967296)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((((B % 4294967296 >= 0 && A % 4294967296 >= 0) && B % 4294967296 <= 1) && (r == A + A / 4294967296 * -4294967296 || (-1 * r + A + A / 4294967296 * -4294967296 == 0 && !(r == A + A / 4294967296 * -4294967296)))) && p == 1) && d == B % 4294967296) && A % 4294967296 <= 1) && p >= 1) && q == 0) && B % 4294967296 >= 1) && r == A % 4294967296) && B % 4294967296 >= d) || ((((((((((((((((B % 4294967296 >= 0 && A % 4294967296 >= 0) && B % 4294967296 <= 1) && (r == A + A / 4294967296 * -4294967296 || (-1 * r + A + A / 4294967296 * -4294967296 == 0 && !(r == A + A / 4294967296 * -4294967296)))) && r >= -d / -2) && A % 4294967296 <= 1) && 2 * (B % 4294967296) == d) && 2 <= p) && r >= B % 4294967296) && q == 0) && p * (B % 4294967296) == d) && B % 4294967296 >= 1) && B % 4294967296 >= -d / -2) && q * (B % 4294967296) + r == A % 4294967296) && r == A % 4294967296) && d % 2 == 0) && p == 2 * 1) RESULT: Ultimate proved your program to be correct! [2023-02-17 01:59:37,744 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