./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd3-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/egcd3-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 40c004ecbeb3948e318f4c5fc8011bd289b059bb9dbb2959c45853a9680cf20f --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 02:07:12,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 02:07:12,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 02:07:12,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 02:07:12,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 02:07:12,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 02:07:12,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 02:07:12,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 02:07:12,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 02:07:12,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 02:07:12,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 02:07:12,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 02:07:12,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 02:07:12,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 02:07:12,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 02:07:12,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 02:07:12,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 02:07:12,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 02:07:12,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 02:07:12,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 02:07:12,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 02:07:12,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 02:07:12,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 02:07:12,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 02:07:12,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 02:07:12,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 02:07:12,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 02:07:12,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 02:07:12,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 02:07:12,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 02:07:12,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 02:07:12,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 02:07:12,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 02:07:12,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 02:07:12,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 02:07:12,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 02:07:12,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 02:07:12,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 02:07:12,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 02:07:12,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 02:07:12,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 02:07:12,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 02:07:12,646 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 02:07:12,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 02:07:12,647 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 02:07:12,647 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 02:07:12,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 02:07:12,648 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 02:07:12,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 02:07:12,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 02:07:12,649 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 02:07:12,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 02:07:12,649 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 02:07:12,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 02:07:12,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 02:07:12,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 02:07:12,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 02:07:12,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 02:07:12,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 02:07:12,650 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 02:07:12,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 02:07:12,651 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 02:07:12,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 02:07:12,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 02:07:12,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 02:07:12,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 02:07:12,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 02:07:12,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 02:07:12,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 02:07:12,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 02:07:12,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 02:07:12,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 02:07:12,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 02:07:12,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 02:07:12,652 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 02:07:12,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 02:07:12,653 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 02:07:12,653 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 -> 40c004ecbeb3948e318f4c5fc8011bd289b059bb9dbb2959c45853a9680cf20f [2023-02-18 02:07:12,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 02:07:12,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 02:07:12,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 02:07:12,848 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 02:07:12,849 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 02:07:12,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound1.c [2023-02-18 02:07:13,847 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 02:07:13,979 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 02:07:13,979 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound1.c [2023-02-18 02:07:13,984 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c869a59/110ce551754a4457817d5474e6521531/FLAG36705dfbc [2023-02-18 02:07:13,993 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c869a59/110ce551754a4457817d5474e6521531 [2023-02-18 02:07:13,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 02:07:13,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 02:07:13,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 02:07:13,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 02:07:14,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 02:07:14,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:07:13" (1/1) ... [2023-02-18 02:07:14,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff31ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14, skipping insertion in model container [2023-02-18 02:07:14,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:07:13" (1/1) ... [2023-02-18 02:07:14,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 02:07:14,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 02:07:14,116 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/egcd3-ll_valuebound1.c[490,503] [2023-02-18 02:07:14,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 02:07:14,132 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 02:07:14,140 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/egcd3-ll_valuebound1.c[490,503] [2023-02-18 02:07:14,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 02:07:14,160 INFO L208 MainTranslator]: Completed translation [2023-02-18 02:07:14,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14 WrapperNode [2023-02-18 02:07:14,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 02:07:14,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 02:07:14,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 02:07:14,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 02:07:14,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,180 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2023-02-18 02:07:14,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 02:07:14,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 02:07:14,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 02:07:14,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 02:07:14,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,192 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 02:07:14,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 02:07:14,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 02:07:14,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 02:07:14,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (1/1) ... [2023-02-18 02:07:14,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 02:07:14,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:14,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 02:07:14,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 02:07:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 02:07:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 02:07:14,259 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 02:07:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 02:07:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 02:07:14,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 02:07:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 02:07:14,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 02:07:14,300 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 02:07:14,302 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 02:07:14,410 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 02:07:14,414 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 02:07:14,414 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-18 02:07:14,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:07:14 BoogieIcfgContainer [2023-02-18 02:07:14,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 02:07:14,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 02:07:14,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 02:07:14,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 02:07:14,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 02:07:13" (1/3) ... [2023-02-18 02:07:14,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7a623e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:07:14, skipping insertion in model container [2023-02-18 02:07:14,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:07:14" (2/3) ... [2023-02-18 02:07:14,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7a623e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:07:14, skipping insertion in model container [2023-02-18 02:07:14,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:07:14" (3/3) ... [2023-02-18 02:07:14,421 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound1.c [2023-02-18 02:07:14,432 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 02:07:14,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 02:07:14,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 02:07:14,475 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;@9a4ccf2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 02:07:14,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 02:07:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 02:07:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 02:07:14,483 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:14,483 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:14,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 872320404, now seen corresponding path program 1 times [2023-02-18 02:07:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:14,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992050076] [2023-02-18 02:07:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:14,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992050076] [2023-02-18 02:07:14,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 02:07:14,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240181419] [2023-02-18 02:07:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:14,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:14,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:14,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:14,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 02:07:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:14,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 02:07:14,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 02:07:14,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 02:07:14,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240181419] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 02:07:14,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 02:07:14,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 02:07:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362872321] [2023-02-18 02:07:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 02:07:14,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 02:07:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:14,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 02:07:14,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 02:07:14,795 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 02:07:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:14,809 INFO L93 Difference]: Finished difference Result 67 states and 109 transitions. [2023-02-18 02:07:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 02:07:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-02-18 02:07:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:14,815 INFO L225 Difference]: With dead ends: 67 [2023-02-18 02:07:14,815 INFO L226 Difference]: Without dead ends: 31 [2023-02-18 02:07:14,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 02:07:14,819 INFO L413 NwaCegarLoop]: 44 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, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:14,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 02:07:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-18 02:07:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-18 02:07:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 02:07:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2023-02-18 02:07:14,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 29 [2023-02-18 02:07:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:14,844 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-02-18 02:07:14,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 02:07:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2023-02-18 02:07:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 02:07:14,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:14,846 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:14,852 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-18 02:07:15,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-18 02:07:15,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:15,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:15,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1714405113, now seen corresponding path program 1 times [2023-02-18 02:07:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:15,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266690029] [2023-02-18 02:07:15,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:15,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:15,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:15,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051090956] [2023-02-18 02:07:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:15,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:15,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:15,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:15,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 02:07:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:15,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 02:07:15,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 02:07:15,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 02:07:15,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:15,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266690029] [2023-02-18 02:07:15,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:15,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051090956] [2023-02-18 02:07:15,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051090956] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 02:07:15,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 02:07:15,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 02:07:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009388863] [2023-02-18 02:07:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 02:07:15,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 02:07:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:15,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 02:07:15,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 02:07:15,161 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 02:07:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:15,222 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2023-02-18 02:07:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 02:07:15,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2023-02-18 02:07:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:15,224 INFO L225 Difference]: With dead ends: 50 [2023-02-18 02:07:15,224 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 02:07:15,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 02:07:15,225 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:15,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 113 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 02:07:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 02:07:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2023-02-18 02:07:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 02:07:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-02-18 02:07:15,236 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 30 [2023-02-18 02:07:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:15,237 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-02-18 02:07:15,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 02:07:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-02-18 02:07:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 02:07:15,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:15,238 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:15,242 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-18 02:07:15,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-18 02:07:15,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1825736765, now seen corresponding path program 1 times [2023-02-18 02:07:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:15,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277296211] [2023-02-18 02:07:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:15,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:15,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893370089] [2023-02-18 02:07:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:15,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:15,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:15,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:15,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 02:07:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:15,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 02:07:15,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 02:07:15,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 02:07:15,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:15,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277296211] [2023-02-18 02:07:15,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:15,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893370089] [2023-02-18 02:07:15,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893370089] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 02:07:15,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 02:07:15,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-02-18 02:07:15,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466793216] [2023-02-18 02:07:15,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 02:07:15,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 02:07:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 02:07:15,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-18 02:07:15,784 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 02:07:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:15,859 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2023-02-18 02:07:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 02:07:15,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2023-02-18 02:07:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:15,862 INFO L225 Difference]: With dead ends: 49 [2023-02-18 02:07:15,862 INFO L226 Difference]: Without dead ends: 47 [2023-02-18 02:07:15,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-02-18 02:07:15,865 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:15,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 147 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 02:07:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-18 02:07:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-02-18 02:07:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-18 02:07:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2023-02-18 02:07:15,881 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 33 [2023-02-18 02:07:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:15,881 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2023-02-18 02:07:15,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 02:07:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2023-02-18 02:07:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-18 02:07:15,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:15,882 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:15,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 02:07:16,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:16,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1547103247, now seen corresponding path program 1 times [2023-02-18 02:07:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:16,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955903083] [2023-02-18 02:07:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:16,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:16,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568700419] [2023-02-18 02:07:16,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:16,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:16,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:16,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:16,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 02:07:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:16,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 02:07:16,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 02:07:16,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 02:07:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:16,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955903083] [2023-02-18 02:07:16,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:16,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568700419] [2023-02-18 02:07:16,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568700419] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:07:16,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:07:16,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-18 02:07:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884301307] [2023-02-18 02:07:16,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:07:16,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 02:07:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:16,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 02:07:16,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-18 02:07:16,210 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 02:07:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:16,344 INFO L93 Difference]: Finished difference Result 99 states and 139 transitions. [2023-02-18 02:07:16,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 02:07:16,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-02-18 02:07:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:16,345 INFO L225 Difference]: With dead ends: 99 [2023-02-18 02:07:16,345 INFO L226 Difference]: Without dead ends: 92 [2023-02-18 02:07:16,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 02:07:16,346 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:16,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 209 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 02:07:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-18 02:07:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2023-02-18 02:07:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 02:07:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2023-02-18 02:07:16,355 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 35 [2023-02-18 02:07:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:16,355 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2023-02-18 02:07:16,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 02:07:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2023-02-18 02:07:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 02:07:16,356 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:16,357 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:16,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 02:07:16,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:16,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash -720434099, now seen corresponding path program 1 times [2023-02-18 02:07:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:16,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281589132] [2023-02-18 02:07:16,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:16,571 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:16,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160780885] [2023-02-18 02:07:16,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:16,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:16,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:16,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:16,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 02:07:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:16,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-18 02:07:16,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 02:07:16,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:16,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:16,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281589132] [2023-02-18 02:07:16,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:16,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160780885] [2023-02-18 02:07:16,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160780885] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 02:07:16,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 02:07:16,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-18 02:07:16,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104577054] [2023-02-18 02:07:16,940 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 02:07:16,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 02:07:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 02:07:16,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-02-18 02:07:16,941 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 02:07:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:17,161 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2023-02-18 02:07:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 02:07:17,161 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-02-18 02:07:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:17,162 INFO L225 Difference]: With dead ends: 82 [2023-02-18 02:07:17,162 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 02:07:17,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-02-18 02:07:17,163 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 57 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:17,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 135 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 02:07:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 02:07:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2023-02-18 02:07:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 50 states have internal predecessors, (61), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 02:07:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2023-02-18 02:07:17,178 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 38 [2023-02-18 02:07:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:17,179 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2023-02-18 02:07:17,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 02:07:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2023-02-18 02:07:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 02:07:17,183 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:17,183 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:17,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 02:07:17,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:17,398 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash -376152117, now seen corresponding path program 1 times [2023-02-18 02:07:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:17,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188376529] [2023-02-18 02:07:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:17,408 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:17,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432057372] [2023-02-18 02:07:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:17,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:17,410 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:17,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 02:07:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:17,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 02:07:17,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 02:07:17,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 02:07:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:17,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188376529] [2023-02-18 02:07:17,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432057372] [2023-02-18 02:07:17,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432057372] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:07:17,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:07:17,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-02-18 02:07:17,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672405113] [2023-02-18 02:07:17,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:07:17,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 02:07:17,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 02:07:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-02-18 02:07:17,613 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 02:07:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:17,818 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2023-02-18 02:07:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 02:07:17,819 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 38 [2023-02-18 02:07:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:17,819 INFO L225 Difference]: With dead ends: 101 [2023-02-18 02:07:17,819 INFO L226 Difference]: Without dead ends: 60 [2023-02-18 02:07:17,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-02-18 02:07:17,821 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 131 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:17,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 170 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 02:07:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-18 02:07:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2023-02-18 02:07:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-18 02:07:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2023-02-18 02:07:17,827 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 38 [2023-02-18 02:07:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:17,827 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2023-02-18 02:07:17,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 02:07:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2023-02-18 02:07:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 02:07:17,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:17,828 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:17,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-18 02:07:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:18,033 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash 279172547, now seen corresponding path program 1 times [2023-02-18 02:07:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:18,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274825904] [2023-02-18 02:07:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:18,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:18,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797867633] [2023-02-18 02:07:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:18,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:18,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:18,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:18,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 02:07:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:18,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 02:07:18,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 02:07:18,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:20,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:20,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274825904] [2023-02-18 02:07:20,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:20,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797867633] [2023-02-18 02:07:20,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797867633] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 02:07:20,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 02:07:20,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-02-18 02:07:20,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669071675] [2023-02-18 02:07:20,354 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 02:07:20,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 02:07:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:20,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 02:07:20,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=171, Unknown=1, NotChecked=0, Total=210 [2023-02-18 02:07:20,355 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 02:07:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:20,608 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-18 02:07:20,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 02:07:20,609 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2023-02-18 02:07:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:20,609 INFO L225 Difference]: With dead ends: 66 [2023-02-18 02:07:20,609 INFO L226 Difference]: Without dead ends: 64 [2023-02-18 02:07:20,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=55, Invalid=250, Unknown=1, NotChecked=0, Total=306 [2023-02-18 02:07:20,610 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:20,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 129 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 02:07:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-18 02:07:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2023-02-18 02:07:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 40 states have internal predecessors, (46), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 02:07:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-02-18 02:07:20,617 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 43 [2023-02-18 02:07:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:20,618 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-02-18 02:07:20,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 02:07:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-02-18 02:07:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-18 02:07:20,618 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:20,618 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:20,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 02:07:20,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:20,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:20,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1189241395, now seen corresponding path program 1 times [2023-02-18 02:07:20,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:20,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147422360] [2023-02-18 02:07:20,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:20,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:20,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:20,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524912020] [2023-02-18 02:07:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:20,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:20,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 02:07:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:20,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 02:07:20,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 02:07:20,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 02:07:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:20,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147422360] [2023-02-18 02:07:20,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:20,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524912020] [2023-02-18 02:07:20,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524912020] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 02:07:20,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 02:07:20,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2023-02-18 02:07:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029490081] [2023-02-18 02:07:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 02:07:20,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 02:07:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:20,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 02:07:20,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-18 02:07:20,995 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 02:07:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:21,031 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2023-02-18 02:07:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 02:07:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2023-02-18 02:07:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:21,033 INFO L225 Difference]: With dead ends: 71 [2023-02-18 02:07:21,033 INFO L226 Difference]: Without dead ends: 69 [2023-02-18 02:07:21,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-02-18 02:07:21,034 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:21,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 02:07:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-18 02:07:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-02-18 02:07:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 43 states have internal predecessors, (49), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 02:07:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2023-02-18 02:07:21,049 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 48 [2023-02-18 02:07:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:21,050 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2023-02-18 02:07:21,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 02:07:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2023-02-18 02:07:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-18 02:07:21,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:21,053 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:21,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 02:07:21,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-18 02:07:21,260 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:21,260 INFO L85 PathProgramCache]: Analyzing trace with hash -828341661, now seen corresponding path program 1 times [2023-02-18 02:07:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:21,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189195437] [2023-02-18 02:07:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:21,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:21,278 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:21,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848193005] [2023-02-18 02:07:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:21,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:21,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:21,283 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:21,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 02:07:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:21,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-18 02:07:21,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 02:07:21,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-18 02:07:21,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:21,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189195437] [2023-02-18 02:07:21,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:21,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848193005] [2023-02-18 02:07:21,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848193005] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:07:21,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:07:21,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2023-02-18 02:07:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633647109] [2023-02-18 02:07:21,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:07:21,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-18 02:07:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:21,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-18 02:07:21,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-02-18 02:07:21,814 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 24 states have internal predecessors, (51), 9 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2023-02-18 02:07:26,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 02:07:30,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 02:07:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:31,696 INFO L93 Difference]: Finished difference Result 207 states and 293 transitions. [2023-02-18 02:07:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-18 02:07:31,697 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 24 states have internal predecessors, (51), 9 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) Word has length 60 [2023-02-18 02:07:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:31,699 INFO L225 Difference]: With dead ends: 207 [2023-02-18 02:07:31,699 INFO L226 Difference]: Without dead ends: 182 [2023-02-18 02:07:31,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=499, Invalid=2581, Unknown=0, NotChecked=0, Total=3080 [2023-02-18 02:07:31,700 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 189 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 277 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:31,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 304 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1577 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2023-02-18 02:07:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-18 02:07:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 129. [2023-02-18 02:07:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 84 states have internal predecessors, (100), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-02-18 02:07:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 176 transitions. [2023-02-18 02:07:31,738 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 176 transitions. Word has length 60 [2023-02-18 02:07:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:31,739 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 176 transitions. [2023-02-18 02:07:31,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 24 states have internal predecessors, (51), 9 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 6 states have call predecessors, (16), 7 states have call successors, (16) [2023-02-18 02:07:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2023-02-18 02:07:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 02:07:31,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:31,742 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:31,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 02:07:31,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:31,950 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:31,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2000413383, now seen corresponding path program 2 times [2023-02-18 02:07:31,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:31,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770042891] [2023-02-18 02:07:31,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:31,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:31,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266832280] [2023-02-18 02:07:31,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 02:07:31,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:31,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:31,972 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:31,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 02:07:32,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 02:07:32,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 02:07:32,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 02:07:32,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-02-18 02:07:32,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-02-18 02:07:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:32,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770042891] [2023-02-18 02:07:32,063 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:32,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266832280] [2023-02-18 02:07:32,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266832280] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:07:32,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:07:32,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-18 02:07:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840672713] [2023-02-18 02:07:32,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:07:32,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 02:07:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 02:07:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-18 02:07:32,066 INFO L87 Difference]: Start difference. First operand 129 states and 176 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 02:07:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:32,344 INFO L93 Difference]: Finished difference Result 233 states and 323 transitions. [2023-02-18 02:07:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 02:07:32,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 65 [2023-02-18 02:07:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:32,346 INFO L225 Difference]: With dead ends: 233 [2023-02-18 02:07:32,346 INFO L226 Difference]: Without dead ends: 174 [2023-02-18 02:07:32,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2023-02-18 02:07:32,347 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 52 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:32,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 232 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 02:07:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-18 02:07:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 139. [2023-02-18 02:07:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 91 states have internal predecessors, (105), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-02-18 02:07:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 186 transitions. [2023-02-18 02:07:32,382 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 186 transitions. Word has length 65 [2023-02-18 02:07:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:32,382 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 186 transitions. [2023-02-18 02:07:32,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 02:07:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2023-02-18 02:07:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-18 02:07:32,383 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:32,383 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 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, 1, 1] [2023-02-18 02:07:32,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-18 02:07:32,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 02:07:32,587 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1382204855, now seen corresponding path program 1 times [2023-02-18 02:07:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:32,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17316668] [2023-02-18 02:07:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:32,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:32,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343968104] [2023-02-18 02:07:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:32,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:32,595 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:32,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 02:07:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:32,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 02:07:32,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-02-18 02:07:32,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-18 02:07:32,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:32,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17316668] [2023-02-18 02:07:32,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:32,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343968104] [2023-02-18 02:07:32,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343968104] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:07:32,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:07:32,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-18 02:07:32,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141592384] [2023-02-18 02:07:32,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:07:32,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 02:07:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 02:07:32,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-02-18 02:07:32,752 INFO L87 Difference]: Start difference. First operand 139 states and 186 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2023-02-18 02:07:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:32,955 INFO L93 Difference]: Finished difference Result 198 states and 261 transitions. [2023-02-18 02:07:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 02:07:32,956 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2023-02-18 02:07:32,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:32,957 INFO L225 Difference]: With dead ends: 198 [2023-02-18 02:07:32,957 INFO L226 Difference]: Without dead ends: 117 [2023-02-18 02:07:32,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2023-02-18 02:07:32,959 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 75 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:32,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 212 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 02:07:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-18 02:07:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-02-18 02:07:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 33 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-02-18 02:07:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2023-02-18 02:07:32,998 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 68 [2023-02-18 02:07:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:32,998 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2023-02-18 02:07:32,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2023-02-18 02:07:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2023-02-18 02:07:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-18 02:07:32,999 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:07:32,999 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 3, 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, 1] [2023-02-18 02:07:33,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 02:07:33,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 02:07:33,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:07:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:07:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash 930066712, now seen corresponding path program 1 times [2023-02-18 02:07:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:07:33,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248508955] [2023-02-18 02:07:33,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:33,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:07:33,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:07:33,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471938330] [2023-02-18 02:07:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:07:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:07:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:07:33,221 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:07:33,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 02:07:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:07:33,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 02:07:33,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:07:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 17 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-02-18 02:07:33,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:07:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 17 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-02-18 02:07:33,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:07:33,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248508955] [2023-02-18 02:07:33,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:07:33,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471938330] [2023-02-18 02:07:33,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471938330] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:07:33,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:07:33,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-18 02:07:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329121355] [2023-02-18 02:07:33,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:07:33,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 02:07:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:07:33,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 02:07:33,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-02-18 02:07:33,409 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 02:07:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:07:33,620 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2023-02-18 02:07:33,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 02:07:33,621 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 85 [2023-02-18 02:07:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:07:33,621 INFO L225 Difference]: With dead ends: 127 [2023-02-18 02:07:33,621 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 02:07:33,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2023-02-18 02:07:33,622 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 02:07:33,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 02:07:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 02:07:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 02:07:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 02:07:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 02:07:33,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2023-02-18 02:07:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:07:33,623 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 02:07:33,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 02:07:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 02:07:33,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 02:07:33,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 02:07:33,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 02:07:33,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 02:07:33,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 02:07:33,850 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 73) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse2 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse1 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse5 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse7 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse9 (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1)) (.cse10 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse11 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse8 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse12 (+ |ULTIMATE.start_main_~b~0#1| 1))) (or (and (= |ULTIMATE.start_main_~p~0#1| 1) .cse0 (<= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~r~0#1| 0) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) .cse4 .cse5 (>= |ULTIMATE.start_main_~a~0#1| 0) .cse6 .cse7 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse8 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1) (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|)) (and .cse9 (>= |ULTIMATE.start_main_~b~0#1| 0) .cse0 .cse10 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 (<= .cse12 1) .cse5 .cse6 .cse7 .cse8) (let ((.cse14 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse13 (+ 0 1))) (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~a~0#1| (+ (- 1) (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ (* .cse13 0) |ULTIMATE.start_main_~q~0#1|) 1) (= |ULTIMATE.start_main_~b~0#1| 0) .cse1 .cse3 .cse5 (<= |ULTIMATE.start_main_~b~0#1| (+ (- 1) |ULTIMATE.start_main_~a~0#1|)) .cse14 (= |ULTIMATE.start_main_~r~0#1| 1) .cse6 .cse7 (exists ((|ULTIMATE.start_main_~v~0#1| Int)) (let ((.cse15 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~v~0#1|))) (and (<= |ULTIMATE.start_main_~v~0#1| 1) (not (>= .cse15 (* 2 |ULTIMATE.start_main_~v~0#1|))) (<= |ULTIMATE.start_main_~v~0#1| .cse15)))) (or (and .cse9 .cse10 .cse11) .cse14) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse8 (< |ULTIMATE.start_main_~c~0#1| .cse12) (= (+ (- (* |ULTIMATE.start_main_~r~0#1| .cse13)) 0) |ULTIMATE.start_main_~s~0#1|) (exists ((|ULTIMATE.start_main_~v~0#1| Int)) (let ((.cse16 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~v~0#1|))) (and (<= |ULTIMATE.start_main_~v~0#1| .cse16) (<= |ULTIMATE.start_main_~v~0#1| 1) (not (>= .cse16 (* 2 |ULTIMATE.start_main_~v~0#1|)))))))))) [2023-02-18 02:07:33,851 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 73) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_main_~c~0#1| 1)) (.cse17 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse8 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse19 (< |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse21 (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse20 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|))) (let ((.cse0 (let ((.cse22 (or (= |ULTIMATE.start_main_~b~0#1| 0) .cse19 (= (+ .cse21 .cse20) |ULTIMATE.start_main_~a~0#1|)))) (or (and .cse22 .cse4 (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse8) (and .cse22 .cse4 .cse8)))) (.cse1 (>= |ULTIMATE.start_main_~b~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse6 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) 1)) (.cse7 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse10 (or (and (<= .cse16 1) (<= |ULTIMATE.start_main_~c~0#1| 1) (>= |ULTIMATE.start_main_~c~0#1| 0)) .cse17)) (.cse11 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse2 (+ 0 1))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_main_~a~0#1| (+ (- 1) (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ (* .cse2 0) |ULTIMATE.start_main_~q~0#1|) 1) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~r~0#1| 1) .cse8 .cse9 .cse10 (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse11 (= (+ (- (* |ULTIMATE.start_main_~r~0#1| .cse2)) 0) |ULTIMATE.start_main_~s~0#1|)) (let ((.cse14 (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse13 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (let ((.cse15 (* 2 |ULTIMATE.start_main_~b~0#1|)) (.cse18 (not (= (+ .cse14 .cse13) |ULTIMATE.start_main_~b~0#1|)))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (= (let ((.cse12 (+ |ULTIMATE.start_main_~k~0#1| 1))) (+ (+ (+ (- (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse12 (- 1) |ULTIMATE.start_main_~q~0#1|)))) .cse13) .cse14) (- (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse12 |ULTIMATE.start_main_~s~0#1|))))))) |ULTIMATE.start_main_~b~0#1|) (< .cse15 .cse16) (not .cse17) .cse18) (or (< (+ (- 1) .cse15) |ULTIMATE.start_main_~b~0#1|) .cse19 .cse18 (= |ULTIMATE.start_main_~b~0#1| (+ (+ (+ .cse13 (- (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse2))))) .cse14) (- (* (+ (- (* |ULTIMATE.start_main_~s~0#1| .cse2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|))))) (= |ULTIMATE.start_main_~a~0#1| (+ (+ (+ (- .cse13) .cse20) .cse21) (- .cse14))))))))) [2023-02-18 02:07:33,851 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse17 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse8 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse19 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse23 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse18 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|)) (.cse6 (= (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~d~0#1|) |ULTIMATE.start_main_~v~0#1|)) (.cse11 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse12 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse14 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse16 (let ((.cse26 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse24 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse25 (let ((.cse27 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse28 (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse29 (let ((.cse30 (or .cse9 (and .cse9 (<= 1 |ULTIMATE.start_main_~b~0#1|)))) (.cse31 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse32 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (or (and (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse30 .cse31 .cse18 .cse32) (and .cse30 .cse31 .cse18 .cse32))))) (or (and .cse7 .cse27 .cse9 .cse13 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|) .cse15 .cse21 .cse23 .cse28 .cse29) (and .cse7 .cse27 .cse9 .cse13 .cse15 .cse21 .cse23 .cse28 .cse29))))) (or (and .cse3 .cse4 .cse10 .cse15 .cse24 .cse19 .cse25 (or (and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1) .cse8 .cse26) .cse17) .cse21) (and .cse3 .cse4 .cse8 .cse10 .cse26 .cse15 .cse24 .cse19 .cse25 .cse21)))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 (<= (* 2 |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4 (or (= |ULTIMATE.start_main_~b~0#1| (let ((.cse5 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|))) (+ (- (* (+ (- (* .cse5 |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (- (* |ULTIMATE.start_main_~x~0#1| (+ (* .cse5 (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)))))) (>= |ULTIMATE.start_main_~c~0#1| (* 2 |ULTIMATE.start_main_~v~0#1|))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~v~0#1|) 2)) 2) |ULTIMATE.start_main_~c~0#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_main_~v~0#1| 1) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (>= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse20 .cse21 .cse22 .cse23)))) [2023-02-18 02:07:33,852 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 18 76) the Hoare annotation is: true [2023-02-18 02:07:33,852 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2023-02-18 02:07:33,852 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 02:07:33,852 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 02:07:33,852 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 1) (>= |ULTIMATE.start_main_~x~0#1| 0)) [2023-02-18 02:07:33,852 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 1) (>= |ULTIMATE.start_main_~x~0#1| 0)) [2023-02-18 02:07:33,852 INFO L899 garLoopResultBuilder]: For program point L53(lines 49 59) no Hoare annotation was computed. [2023-02-18 02:07:33,853 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 59) the Hoare annotation is: (let ((.cse17 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse8 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse19 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse23 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse18 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|)) (.cse6 (= (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~d~0#1|) |ULTIMATE.start_main_~v~0#1|)) (.cse11 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse12 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse14 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse16 (let ((.cse26 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse24 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse25 (let ((.cse27 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse28 (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse29 (let ((.cse30 (or .cse9 (and .cse9 (<= 1 |ULTIMATE.start_main_~b~0#1|)))) (.cse31 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse32 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (or (and (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse30 .cse31 .cse18 .cse32) (and .cse30 .cse31 .cse18 .cse32))))) (or (and .cse7 .cse27 .cse9 .cse13 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|) .cse15 .cse21 .cse23 .cse28 .cse29) (and .cse7 .cse27 .cse9 .cse13 .cse15 .cse21 .cse23 .cse28 .cse29))))) (or (and .cse3 .cse4 .cse10 .cse15 .cse24 .cse19 .cse25 (or (and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1) .cse8 .cse26) .cse17) .cse21) (and .cse3 .cse4 .cse8 .cse10 .cse26 .cse15 .cse24 .cse19 .cse25 .cse21)))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 (<= (* 2 |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4 (or (= |ULTIMATE.start_main_~b~0#1| (let ((.cse5 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|))) (+ (- (* (+ (- (* .cse5 |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (- (* |ULTIMATE.start_main_~x~0#1| (+ (* .cse5 (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)))))) (>= |ULTIMATE.start_main_~c~0#1| (* 2 |ULTIMATE.start_main_~v~0#1|))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~v~0#1|) 2)) 2) |ULTIMATE.start_main_~c~0#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_main_~v~0#1| 1) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (>= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse20 .cse21 .cse22 .cse23)))) [2023-02-18 02:07:33,853 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 59) no Hoare annotation was computed. [2023-02-18 02:07:33,853 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-02-18 02:07:33,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 02:07:33,853 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1) (>= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 1) (>= |ULTIMATE.start_main_~x~0#1| 0)) [2023-02-18 02:07:33,853 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse17 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse8 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse19 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse23 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse18 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|)) (.cse6 (= (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~d~0#1|) |ULTIMATE.start_main_~v~0#1|)) (.cse11 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse12 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse14 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse16 (let ((.cse26 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse24 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse25 (let ((.cse27 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse28 (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse29 (let ((.cse30 (or .cse9 (and .cse9 (<= 1 |ULTIMATE.start_main_~b~0#1|)))) (.cse31 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse32 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (or (and (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse30 .cse31 .cse18 .cse32) (and .cse30 .cse31 .cse18 .cse32))))) (or (and .cse7 .cse27 .cse9 .cse13 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|) .cse15 .cse21 .cse23 .cse28 .cse29) (and .cse7 .cse27 .cse9 .cse13 .cse15 .cse21 .cse23 .cse28 .cse29))))) (or (and .cse3 .cse4 .cse10 .cse15 .cse24 .cse19 .cse25 (or (and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1) .cse8 .cse26) .cse17) .cse21) (and .cse3 .cse4 .cse8 .cse10 .cse26 .cse15 .cse24 .cse19 .cse25 .cse21)))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 (<= (* 2 |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4 (or (= |ULTIMATE.start_main_~b~0#1| (let ((.cse5 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|))) (+ (- (* (+ (- (* .cse5 |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (- (* |ULTIMATE.start_main_~x~0#1| (+ (* .cse5 (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)))))) (>= |ULTIMATE.start_main_~c~0#1| (* 2 |ULTIMATE.start_main_~v~0#1|))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~v~0#1|) 2)) 2) |ULTIMATE.start_main_~c~0#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_main_~v~0#1| 1) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (>= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse20 .cse21 .cse22 .cse23)))) [2023-02-18 02:07:33,854 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse17 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse8 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse19 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse23 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse18 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|)) (.cse6 (= (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~d~0#1|) |ULTIMATE.start_main_~v~0#1|)) (.cse11 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse12 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse14 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse16 (let ((.cse26 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse24 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse25 (let ((.cse27 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse28 (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse29 (let ((.cse30 (or .cse9 (and .cse9 (<= 1 |ULTIMATE.start_main_~b~0#1|)))) (.cse31 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse32 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (or (and (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse30 .cse31 .cse18 .cse32) (and .cse30 .cse31 .cse18 .cse32))))) (or (and .cse7 .cse27 .cse9 .cse13 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|) .cse15 .cse21 .cse23 .cse28 .cse29) (and .cse7 .cse27 .cse9 .cse13 .cse15 .cse21 .cse23 .cse28 .cse29))))) (or (and .cse3 .cse4 .cse10 .cse15 .cse24 .cse19 .cse25 (or (and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1) .cse8 .cse26) .cse17) .cse21) (and .cse3 .cse4 .cse8 .cse10 .cse26 .cse15 .cse24 .cse19 .cse25 .cse21)))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 (<= (* 2 |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4 (or (= |ULTIMATE.start_main_~b~0#1| (let ((.cse5 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|))) (+ (- (* (+ (- (* .cse5 |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (- (* |ULTIMATE.start_main_~x~0#1| (+ (* .cse5 (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)))))) (>= |ULTIMATE.start_main_~c~0#1| (* 2 |ULTIMATE.start_main_~v~0#1|))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~v~0#1|) 2)) 2) |ULTIMATE.start_main_~c~0#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_main_~v~0#1| 1) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (>= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse20 .cse21 .cse22 .cse23)))) [2023-02-18 02:07:33,854 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 02:07:33,854 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 62) the Hoare annotation is: (let ((.cse5 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse2 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse4 (or .cse5 (and .cse5 (<= 1 |ULTIMATE.start_main_~b~0#1|)))) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse8 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse9 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse10 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse11 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse12 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse13 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse14 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse16 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse17 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse18 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse19 (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|))) (or (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) .cse0 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|) (>= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse18 .cse19) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 (= (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~d~0#1|) |ULTIMATE.start_main_~v~0#1|) .cse3 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) (not (>= |ULTIMATE.start_main_~c~0#1| (* 2 |ULTIMATE.start_main_~v~0#1|))) .cse4 (= |ULTIMATE.start_main_~k~0#1| (+ 0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_main_~b~0#1| (+ (- 1) (* 2 |ULTIMATE.start_main_~b~0#1|))) .cse15 .cse16 .cse17 (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~v~0#1| Int)) (let ((.cse20 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~v~0#1|))) (and (<= |ULTIMATE.start_main_~v~0#1| .cse20) (<= |ULTIMATE.start_main_~v~0#1| 1) (not (>= .cse20 (* 2 |ULTIMATE.start_main_~v~0#1|)))))) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) .cse18 .cse19)))) [2023-02-18 02:07:33,854 INFO L899 garLoopResultBuilder]: For program point L42-3(lines 42 62) no Hoare annotation was computed. [2023-02-18 02:07:33,854 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-18 02:07:33,854 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2023-02-18 02:07:33,855 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-18 02:07:33,855 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse17 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse8 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse19 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse23 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse18 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~c~0#1|)) (.cse6 (= (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~d~0#1|) |ULTIMATE.start_main_~v~0#1|)) (.cse11 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse12 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse14 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse16 (let ((.cse26 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse24 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse25 (let ((.cse27 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse28 (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse29 (let ((.cse30 (or .cse9 (and .cse9 (<= 1 |ULTIMATE.start_main_~b~0#1|)))) (.cse31 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse32 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (or (and (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse30 .cse31 .cse18 .cse32) (and .cse30 .cse31 .cse18 .cse32))))) (or (and .cse7 .cse27 .cse9 .cse13 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|) .cse15 .cse21 .cse23 .cse28 .cse29) (and .cse7 .cse27 .cse9 .cse13 .cse15 .cse21 .cse23 .cse28 .cse29))))) (or (and .cse3 .cse4 .cse10 .cse15 .cse24 .cse19 .cse25 (or (and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1) .cse8 .cse26) .cse17) .cse21) (and .cse3 .cse4 .cse8 .cse10 .cse26 .cse15 .cse24 .cse19 .cse25 .cse21)))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 (<= (* 2 |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4 (or (= |ULTIMATE.start_main_~b~0#1| (let ((.cse5 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~k~0#1|))) (+ (- (* (+ (- (* .cse5 |ULTIMATE.start_main_~s~0#1|)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (- (* |ULTIMATE.start_main_~x~0#1| (+ (* .cse5 (- 1) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)))))) (>= |ULTIMATE.start_main_~c~0#1| (* 2 |ULTIMATE.start_main_~v~0#1|))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~v~0#1|) 2)) 2) |ULTIMATE.start_main_~c~0#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_main_~v~0#1| 1) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (>= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse20 .cse21 .cse22 .cse23)))) [2023-02-18 02:07:33,855 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2023-02-18 02:07:33,855 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-02-18 02:07:33,855 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-18 02:07:33,855 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-02-18 02:07:33,855 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-02-18 02:07:33,855 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2023-02-18 02:07:33,856 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2023-02-18 02:07:33,856 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2023-02-18 02:07:33,856 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 16) the Hoare annotation is: true [2023-02-18 02:07:33,856 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2023-02-18 02:07:33,856 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-02-18 02:07:33,859 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:07:33,860 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 02:07:33,867 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,868 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,868 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,868 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,868 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,872 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,872 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,872 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,872 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,873 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 02:07:33 BoogieIcfgContainer [2023-02-18 02:07:33,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 02:07:33,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 02:07:33,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 02:07:33,889 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 02:07:33,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:07:14" (3/4) ... [2023-02-18 02:07:33,891 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 02:07:33,895 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 02:07:33,895 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 02:07:33,898 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 02:07:33,898 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 02:07:33,898 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 02:07:33,898 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 02:07:33,913 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((p == 1 && b <= 1) && a <= 1) && b == y) && y >= 1) && 1 <= b) && y >= 0) && r == 0) && y <= b) && q == 0) && 1 <= a) && x <= 1) && a >= 0) && x >= 1) && y <= 1) && a == x) && x >= 0) && r * y + p * x == a) && s == 1) && x >= a) || ((((((((((((((c + 1 <= 1 && b >= 0) && b <= 1) && c <= 1) && 1 <= c) && y >= 1) && 1 <= b) && y >= 0) && 1 <= a) && c >= 0) && b + 1 <= 1) && x <= 1) && x >= 1) && y <= 1) && x >= 0)) || ((((((((((((((((((((c == 0 && a <= -1 + 2 * a) && p == 0) && a == y) && (0 + 1) * 0 + q == 1) && b == 0) && y >= 1) && y >= 0) && x <= 1) && b <= -1 + a) && c >= b) && r == 1) && x >= 1) && y <= 1) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= 1 && !(b + ULTIMATE.start_main_~v~0#1 >= 2 * ULTIMATE.start_main_~v~0#1)) && ULTIMATE.start_main_~v~0#1 <= b + ULTIMATE.start_main_~v~0#1)) && (((c + 1 <= 1 && c <= 1) && c >= 0) || c >= b)) && a <= x) && x >= 0) && c < b + 1) && -(r * (0 + 1)) + 0 == s) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= c + ULTIMATE.start_main_~v~0#1 && ULTIMATE.start_main_~v~0#1 <= 1) && !(c + ULTIMATE.start_main_~v~0#1 >= 2 * ULTIMATE.start_main_~v~0#1))) [2023-02-18 02:07:33,913 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((!(b == 0) && p == 1) && a == c) && b <= 1) && a <= 1) && b == y) && c <= 1) && 1 <= c) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= 1) && y >= 0) && r == 0) && y <= b) && q == 0) && 1 <= a) && c <= a) && c >= 0) && k == 0) && x <= 1) && a >= 0) && x >= 1) && y <= 1) && a == x) && x >= 0) && r * y + p * x == a) && c <= x) && s == 1) && x >= a) || (((((((((((((((((((((((((((((c == 0 && p == 1) && b <= 1) && a <= 1) && b * d == v) && b == y) && b <= a) && v <= b) && !(c >= 2 * v)) && (y >= 1 || (y >= 1 && 1 <= b))) && k == 0 + 1) && y >= 1) && y >= 0) && r == 0) && y <= b) && q == 0) && 1 <= a) && x <= 1) && a >= 0) && x >= 1) && y <= 1) && b <= -1 + 2 * b) && a == x) && x >= 0) && r * y + p * x == a) && c + 1 <= b) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= c + ULTIMATE.start_main_~v~0#1 && ULTIMATE.start_main_~v~0#1 <= 1) && !(c + ULTIMATE.start_main_~v~0#1 >= 2 * ULTIMATE.start_main_~v~0#1))) && b <= x) && s == 1) && x >= a) [2023-02-18 02:07:33,923 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 02:07:33,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 02:07:33,924 INFO L158 Benchmark]: Toolchain (without parser) took 19927.66ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 133.4MB in the beginning and 134.4MB in the end (delta: -958.0kB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2023-02-18 02:07:33,924 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 02:07:33,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.30ms. Allocated memory is still 180.4MB. Free memory was 133.4MB in the beginning and 122.4MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 02:07:33,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.30ms. Allocated memory is still 180.4MB. Free memory was 122.4MB in the beginning and 120.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 02:07:33,924 INFO L158 Benchmark]: Boogie Preprocessor took 12.59ms. Allocated memory is still 180.4MB. Free memory was 120.9MB in the beginning and 119.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 02:07:33,925 INFO L158 Benchmark]: RCFGBuilder took 221.60ms. Allocated memory is still 180.4MB. Free memory was 119.8MB in the beginning and 108.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 02:07:33,925 INFO L158 Benchmark]: TraceAbstraction took 19471.02ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 107.7MB in the beginning and 137.5MB in the end (delta: -29.8MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2023-02-18 02:07:33,925 INFO L158 Benchmark]: Witness Printer took 34.70ms. Allocated memory is still 262.1MB. Free memory was 137.5MB in the beginning and 134.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 02:07:33,926 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.14ms. Allocated memory is still 121.6MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.30ms. Allocated memory is still 180.4MB. Free memory was 133.4MB in the beginning and 122.4MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.30ms. Allocated memory is still 180.4MB. Free memory was 122.4MB in the beginning and 120.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.59ms. Allocated memory is still 180.4MB. Free memory was 120.9MB in the beginning and 119.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 221.60ms. Allocated memory is still 180.4MB. Free memory was 119.8MB in the beginning and 108.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19471.02ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 107.7MB in the beginning and 137.5MB in the end (delta: -29.8MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. * Witness Printer took 34.70ms. Allocated memory is still 262.1MB. Free memory was 137.5MB in the beginning and 134.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 748 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 696 mSDsluCounter, 1972 SdHoareTripleChecker+Invalid, 10.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1517 mSDsCounter, 556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3442 IncrementalHoareTripleChecker+Invalid, 3999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 556 mSolverCounterUnsat, 455 mSDtfsCounter, 3442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1075 GetRequests, 848 SyntacticMatches, 9 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=10, InterpolantAutomatonStates: 144, 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, 12 MinimizatonAttempts, 148 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 108 PreInvPairs, 129 NumberOfFragments, 6004 HoareAnnotationTreeSize, 108 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 601 NumberOfCodeBlocks, 601 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 984 ConstructedInterpolants, 7 QuantifiedInterpolants, 4608 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1611 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 962/1114 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 42]: Loop Invariant [2023-02-18 02:07:33,933 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,933 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,935 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,935 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,935 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,935 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((!(b == 0) && p == 1) && a == c) && b <= 1) && a <= 1) && b == y) && c <= 1) && 1 <= c) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= 1) && y >= 0) && r == 0) && y <= b) && q == 0) && 1 <= a) && c <= a) && c >= 0) && k == 0) && x <= 1) && a >= 0) && x >= 1) && y <= 1) && a == x) && x >= 0) && r * y + p * x == a) && c <= x) && s == 1) && x >= a) || (((((((((((((((((((((((((((((c == 0 && p == 1) && b <= 1) && a <= 1) && b * d == v) && b == y) && b <= a) && v <= b) && !(c >= 2 * v)) && (y >= 1 || (y >= 1 && 1 <= b))) && k == 0 + 1) && y >= 1) && y >= 0) && r == 0) && y <= b) && q == 0) && 1 <= a) && x <= 1) && a >= 0) && x >= 1) && y <= 1) && b <= -1 + 2 * b) && a == x) && x >= 0) && r * y + p * x == a) && c + 1 <= b) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= c + ULTIMATE.start_main_~v~0#1 && ULTIMATE.start_main_~v~0#1 <= 1) && !(c + ULTIMATE.start_main_~v~0#1 >= 2 * ULTIMATE.start_main_~v~0#1))) && b <= x) && s == 1) && x >= a) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(b == 0) && 2 * b <= c) && p == 1) && a == c) && b <= 1) && a <= 1) && (b == -((-((d + k) * s) + r) * y) + (s * y + (-(x * ((d + k) * -1 * q + p)) + q * x)) || c >= 2 * v)) && b * d == v) && b == y) && c <= 1) && y >= 1) && y >= 0) && r == 0) && y <= b) && q == 0) && k == 0) && x <= 1) && 2 * ((-1 + v) / 2) + 2 <= c) && (((((((((b <= 1 && a <= 1) && y >= 0) && x <= 1) && a >= 0) && y <= 1) && ((((((((((b == y && b <= a) && y >= 1) && q == 0) && c <= a) && x <= 1) && x >= 0) && s == 1) && x >= a) && (((((1 <= c && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((y >= 1 || (y >= 1 && 1 <= b)) && 1 <= a) && x >= 1) && r * y + p * x == a))) || ((((((((b == y && b <= a) && y >= 1) && q == 0) && x <= 1) && x >= 0) && s == 1) && x >= a) && (((((1 <= c && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((y >= 1 || (y >= 1 && 1 <= b)) && 1 <= a) && x >= 1) && r * y + p * x == a))))) && (((c + 1 <= 1 && c <= 1) && c >= 0) || c >= b)) && x >= 0) || (((((((((b <= 1 && a <= 1) && c <= 1) && y >= 0) && c >= 0) && x <= 1) && a >= 0) && y <= 1) && ((((((((((b == y && b <= a) && y >= 1) && q == 0) && c <= a) && x <= 1) && x >= 0) && s == 1) && x >= a) && (((((1 <= c && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((y >= 1 || (y >= 1 && 1 <= b)) && 1 <= a) && x >= 1) && r * y + p * x == a))) || ((((((((b == y && b <= a) && y >= 1) && q == 0) && x <= 1) && x >= 0) && s == 1) && x >= a) && (((((1 <= c && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((y >= 1 || (y >= 1 && 1 <= b)) && 1 <= a) && x >= 1) && r * y + p * x == a))))) && x >= 0))) && c >= b) && x >= 1) && y <= 1) && a == x) && x >= 0) && c <= x) && s == 1) || (((((((((((((((((((((((((((d == 1 && !(b == 0)) && p == 1) && a == c) && b <= 1) && a <= 1) && b * d == v) && b == y) && c <= 1) && v <= 1) && v <= c) && v <= b) && y >= 1) && y >= 0) && r == 0) && y <= b) && q == 0) && k == 0) && x <= 1) && (((((((((b <= 1 && a <= 1) && y >= 0) && x <= 1) && a >= 0) && y <= 1) && ((((((((((b == y && b <= a) && y >= 1) && q == 0) && c <= a) && x <= 1) && x >= 0) && s == 1) && x >= a) && (((((1 <= c && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((y >= 1 || (y >= 1 && 1 <= b)) && 1 <= a) && x >= 1) && r * y + p * x == a))) || ((((((((b == y && b <= a) && y >= 1) && q == 0) && x <= 1) && x >= 0) && s == 1) && x >= a) && (((((1 <= c && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((y >= 1 || (y >= 1 && 1 <= b)) && 1 <= a) && x >= 1) && r * y + p * x == a))))) && (((c + 1 <= 1 && c <= 1) && c >= 0) || c >= b)) && x >= 0) || (((((((((b <= 1 && a <= 1) && c <= 1) && y >= 0) && c >= 0) && x <= 1) && a >= 0) && y <= 1) && ((((((((((b == y && b <= a) && y >= 1) && q == 0) && c <= a) && x <= 1) && x >= 0) && s == 1) && x >= a) && (((((1 <= c && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((y >= 1 || (y >= 1 && 1 <= b)) && 1 <= a) && x >= 1) && r * y + p * x == a))) || ((((((((b == y && b <= a) && y >= 1) && q == 0) && x <= 1) && x >= 0) && s == 1) && x >= a) && (((((1 <= c && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((y >= 1 || (y >= 1 && 1 <= b)) && 1 <= a) && x >= 1) && r * y + p * x == a))))) && x >= 0))) && c >= b) && x >= 1) && y <= 1) && v >= b) && a == x) && x >= 0) && c <= x) && s == 1) - InvariantResult [Line: 35]: Loop Invariant [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,938 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,940 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,940 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 02:07:33,940 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((p == 1 && b <= 1) && a <= 1) && b == y) && y >= 1) && 1 <= b) && y >= 0) && r == 0) && y <= b) && q == 0) && 1 <= a) && x <= 1) && a >= 0) && x >= 1) && y <= 1) && a == x) && x >= 0) && r * y + p * x == a) && s == 1) && x >= a) || ((((((((((((((c + 1 <= 1 && b >= 0) && b <= 1) && c <= 1) && 1 <= c) && y >= 1) && 1 <= b) && y >= 0) && 1 <= a) && c >= 0) && b + 1 <= 1) && x <= 1) && x >= 1) && y <= 1) && x >= 0)) || ((((((((((((((((((((c == 0 && a <= -1 + 2 * a) && p == 0) && a == y) && (0 + 1) * 0 + q == 1) && b == 0) && y >= 1) && y >= 0) && x <= 1) && b <= -1 + a) && c >= b) && r == 1) && x >= 1) && y <= 1) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= 1 && !(b + ULTIMATE.start_main_~v~0#1 >= 2 * ULTIMATE.start_main_~v~0#1)) && ULTIMATE.start_main_~v~0#1 <= b + ULTIMATE.start_main_~v~0#1)) && (((c + 1 <= 1 && c <= 1) && c >= 0) || c >= b)) && a <= x) && x >= 0) && c < b + 1) && -(r * (0 + 1)) + 0 == s) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= c + ULTIMATE.start_main_~v~0#1 && ULTIMATE.start_main_~v~0#1 <= 1) && !(c + ULTIMATE.start_main_~v~0#1 >= 2 * ULTIMATE.start_main_~v~0#1))) RESULT: Ultimate proved your program to be correct! [2023-02-18 02:07:33,950 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