./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 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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-?-574ddb4 [2023-02-18 17:25:15,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 17:25:15,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 17:25:15,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 17:25:15,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 17:25:15,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 17:25:15,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 17:25:15,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 17:25:15,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 17:25:15,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 17:25:15,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 17:25:15,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 17:25:15,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 17:25:15,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 17:25:15,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 17:25:15,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 17:25:15,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 17:25:15,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 17:25:15,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 17:25:15,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 17:25:15,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 17:25:15,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 17:25:15,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 17:25:15,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 17:25:15,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 17:25:15,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 17:25:15,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 17:25:15,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 17:25:15,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 17:25:15,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 17:25:15,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 17:25:15,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 17:25:15,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 17:25:15,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 17:25:15,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 17:25:15,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 17:25:15,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 17:25:15,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 17:25:15,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 17:25:15,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 17:25:15,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 17:25:15,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 17:25:15,766 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 17:25:15,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 17:25:15,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 17:25:15,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 17:25:15,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 17:25:15,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 17:25:15,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 17:25:15,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 17:25:15,768 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 17:25:15,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 17:25:15,769 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 17:25:15,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 17:25:15,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 17:25:15,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 17:25:15,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 17:25:15,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 17:25:15,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 17:25:15,769 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 17:25:15,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 17:25:15,770 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 17:25:15,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 17:25:15,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 17:25:15,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 17:25:15,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 17:25:15,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 17:25:15,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 17:25:15,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 17:25:15,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 17:25:15,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 17:25:15,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 17:25:15,771 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 17:25:15,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 17:25:15,772 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 17:25:15,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 17:25:15,772 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 17:25:15,772 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 17:25:15,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 17:25:15,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 17:25:15,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 17:25:15,987 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 17:25:15,987 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 17:25:15,988 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 17:25:16,964 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 17:25:17,137 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 17:25:17,137 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound1.c [2023-02-18 17:25:17,141 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21a885f3/4a39fa1478d040ebac8ff9e1c881205b/FLAGb7a0d0a17 [2023-02-18 17:25:17,150 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21a885f3/4a39fa1478d040ebac8ff9e1c881205b [2023-02-18 17:25:17,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 17:25:17,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 17:25:17,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 17:25:17,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 17:25:17,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 17:25:17,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dbe767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17, skipping insertion in model container [2023-02-18 17:25:17,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 17:25:17,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 17:25:17,256 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 17:25:17,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 17:25:17,272 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 17:25:17,279 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 17:25:17,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 17:25:17,299 INFO L208 MainTranslator]: Completed translation [2023-02-18 17:25:17,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17 WrapperNode [2023-02-18 17:25:17,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 17:25:17,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 17:25:17,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 17:25:17,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 17:25:17,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,325 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2023-02-18 17:25:17,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 17:25:17,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 17:25:17,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 17:25:17,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 17:25:17,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,351 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 17:25:17,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 17:25:17,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 17:25:17,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 17:25:17,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (1/1) ... [2023-02-18 17:25:17,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 17:25:17,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:17,394 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 17:25:17,425 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 17:25:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 17:25:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 17:25:17,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 17:25:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 17:25:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 17:25:17,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 17:25:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 17:25:17,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 17:25:17,479 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 17:25:17,481 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 17:25:17,608 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 17:25:17,611 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 17:25:17,611 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-18 17:25:17,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:25:17 BoogieIcfgContainer [2023-02-18 17:25:17,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 17:25:17,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 17:25:17,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 17:25:17,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 17:25:17,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 05:25:17" (1/3) ... [2023-02-18 17:25:17,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ab1e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:25:17, skipping insertion in model container [2023-02-18 17:25:17,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:25:17" (2/3) ... [2023-02-18 17:25:17,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ab1e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:25:17, skipping insertion in model container [2023-02-18 17:25:17,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:25:17" (3/3) ... [2023-02-18 17:25:17,618 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound1.c [2023-02-18 17:25:17,633 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 17:25:17,633 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 17:25:17,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 17:25:17,665 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;@78c25001, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 17:25:17,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 17:25:17,668 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 17:25:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 17:25:17,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:17,673 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 17:25:17,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:17,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:17,676 INFO L85 PathProgramCache]: Analyzing trace with hash 872320404, now seen corresponding path program 1 times [2023-02-18 17:25:17,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:17,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198657419] [2023-02-18 17:25:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:17,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:17,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198657419] [2023-02-18 17:25:17,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 17:25:17,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80927670] [2023-02-18 17:25:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:17,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:17,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:17,758 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 17:25:17,809 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 17:25:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:17,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 17:25:17,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:17,867 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 17:25:17,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 17:25:17,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80927670] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:25:17,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:25:17,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 17:25:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780912514] [2023-02-18 17:25:17,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:25:17,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 17:25:17,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 17:25:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 17:25:17,931 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 17:25:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:17,947 INFO L93 Difference]: Finished difference Result 67 states and 109 transitions. [2023-02-18 17:25:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 17:25:17,949 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 17:25:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:17,953 INFO L225 Difference]: With dead ends: 67 [2023-02-18 17:25:17,953 INFO L226 Difference]: Without dead ends: 31 [2023-02-18 17:25:17,955 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 17:25:17,957 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 17:25:17,958 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 17:25:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-18 17:25:17,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-18 17:25:17,978 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 17:25:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2023-02-18 17:25:17,979 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 29 [2023-02-18 17:25:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:17,980 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-02-18 17:25:17,980 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 17:25:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2023-02-18 17:25:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 17:25:17,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:17,981 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 17:25:17,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 17:25:18,188 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 17:25:18,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:18,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:18,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1714405113, now seen corresponding path program 1 times [2023-02-18 17:25:18,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:18,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096680706] [2023-02-18 17:25:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:18,207 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:18,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998003125] [2023-02-18 17:25:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:18,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:18,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:18,209 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 17:25:18,211 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 17:25:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:18,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 17:25:18,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:18,313 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 17:25:18,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 17:25:18,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096680706] [2023-02-18 17:25:18,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998003125] [2023-02-18 17:25:18,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998003125] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:25:18,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:25:18,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 17:25:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121942435] [2023-02-18 17:25:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:25:18,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 17:25:18,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:18,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 17:25:18,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 17:25:18,317 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 17:25:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:18,381 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2023-02-18 17:25:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 17:25:18,381 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 17:25:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:18,382 INFO L225 Difference]: With dead ends: 50 [2023-02-18 17:25:18,382 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 17:25:18,383 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 17:25:18,384 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 17:25:18,384 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 17:25:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 17:25:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2023-02-18 17:25:18,390 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 17:25:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-02-18 17:25:18,390 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 30 [2023-02-18 17:25:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:18,391 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-02-18 17:25:18,391 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 17:25:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-02-18 17:25:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 17:25:18,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:18,392 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 17:25:18,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 17:25:18,596 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 17:25:18,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:18,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1825736765, now seen corresponding path program 1 times [2023-02-18 17:25:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:18,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61379134] [2023-02-18 17:25:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:18,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:18,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690082047] [2023-02-18 17:25:18,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:18,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:18,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:18,612 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 17:25:18,645 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 17:25:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:18,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 17:25:18,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:18,747 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 17:25:18,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:25:18,825 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 17:25:18,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:18,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61379134] [2023-02-18 17:25:18,826 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:18,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690082047] [2023-02-18 17:25:18,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690082047] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 17:25:18,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:25:18,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-02-18 17:25:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584699036] [2023-02-18 17:25:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:25:18,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 17:25:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 17:25:18,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-18 17:25:18,831 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 17:25:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:18,900 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2023-02-18 17:25:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 17:25:18,900 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 17:25:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:18,901 INFO L225 Difference]: With dead ends: 49 [2023-02-18 17:25:18,901 INFO L226 Difference]: Without dead ends: 47 [2023-02-18 17:25:18,902 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 17:25:18,902 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 17:25:18,903 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 17:25:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-18 17:25:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-02-18 17:25:18,908 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 17:25:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2023-02-18 17:25:18,909 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 33 [2023-02-18 17:25:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:18,910 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2023-02-18 17:25:18,910 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 17:25:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2023-02-18 17:25:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-18 17:25:18,911 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:18,911 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 17:25:18,917 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 17:25:19,117 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 17:25:19,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:19,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1547103247, now seen corresponding path program 1 times [2023-02-18 17:25:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:19,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148150013] [2023-02-18 17:25:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:19,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:19,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135018056] [2023-02-18 17:25:19,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:19,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:19,157 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 17:25:19,159 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 17:25:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:19,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 17:25:19,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:19,239 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 17:25:19,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:25:19,287 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 17:25:19,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:19,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148150013] [2023-02-18 17:25:19,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:19,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135018056] [2023-02-18 17:25:19,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135018056] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:25:19,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:25:19,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-18 17:25:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866475915] [2023-02-18 17:25:19,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:25:19,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 17:25:19,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:19,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 17:25:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-18 17:25:19,291 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 17:25:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:19,429 INFO L93 Difference]: Finished difference Result 99 states and 139 transitions. [2023-02-18 17:25:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 17:25:19,429 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 17:25:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:19,430 INFO L225 Difference]: With dead ends: 99 [2023-02-18 17:25:19,431 INFO L226 Difference]: Without dead ends: 92 [2023-02-18 17:25:19,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:25:19,432 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 17:25:19,432 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 17:25:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-18 17:25:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2023-02-18 17:25:19,441 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 17:25:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2023-02-18 17:25:19,442 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 35 [2023-02-18 17:25:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:19,442 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2023-02-18 17:25:19,442 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 17:25:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2023-02-18 17:25:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 17:25:19,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:19,443 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 17:25:19,463 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 17:25:19,663 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 17:25:19,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -720434099, now seen corresponding path program 1 times [2023-02-18 17:25:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:19,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577653301] [2023-02-18 17:25:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:19,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:19,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964848343] [2023-02-18 17:25:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:19,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:19,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:19,676 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 17:25:19,678 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 17:25:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:19,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-18 17:25:19,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:19,882 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 17:25:19,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:25:19,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:19,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577653301] [2023-02-18 17:25:19,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:19,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964848343] [2023-02-18 17:25:19,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964848343] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 17:25:19,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:25:19,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-18 17:25:19,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482568269] [2023-02-18 17:25:19,986 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 17:25:19,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 17:25:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:19,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 17:25:19,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-02-18 17:25:19,987 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 17:25:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:20,215 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2023-02-18 17:25:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 17:25:20,217 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 17:25:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:20,220 INFO L225 Difference]: With dead ends: 82 [2023-02-18 17:25:20,220 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 17:25:20,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-02-18 17:25:20,223 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 17:25:20,226 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 17:25:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 17:25:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2023-02-18 17:25:20,243 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 17:25:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2023-02-18 17:25:20,245 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 38 [2023-02-18 17:25:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:20,246 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2023-02-18 17:25:20,246 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 17:25:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2023-02-18 17:25:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 17:25:20,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:20,252 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 17:25:20,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 17:25:20,457 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 17:25:20,457 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -376152117, now seen corresponding path program 1 times [2023-02-18 17:25:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:20,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193208977] [2023-02-18 17:25:20,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:20,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:20,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408900102] [2023-02-18 17:25:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:20,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:20,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:20,473 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 17:25:20,475 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 17:25:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:20,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 17:25:20,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:20,560 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 17:25:20,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:25:20,645 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 17:25:20,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:20,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193208977] [2023-02-18 17:25:20,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:20,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408900102] [2023-02-18 17:25:20,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408900102] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:25:20,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:25:20,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-02-18 17:25:20,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121013064] [2023-02-18 17:25:20,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:25:20,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 17:25:20,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:20,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 17:25:20,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-02-18 17:25:20,647 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 17:25:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:20,827 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2023-02-18 17:25:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 17:25:20,827 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 17:25:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:20,828 INFO L225 Difference]: With dead ends: 101 [2023-02-18 17:25:20,828 INFO L226 Difference]: Without dead ends: 60 [2023-02-18 17:25:20,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-02-18 17:25:20,829 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.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:25:20,829 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.1s Time] [2023-02-18 17:25:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-18 17:25:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2023-02-18 17:25:20,834 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 17:25:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2023-02-18 17:25:20,835 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 38 [2023-02-18 17:25:20,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:20,835 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2023-02-18 17:25:20,835 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 17:25:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2023-02-18 17:25:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 17:25:20,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:20,836 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 17:25:20,857 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 17:25:21,041 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 17:25:21,041 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:21,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 279172547, now seen corresponding path program 1 times [2023-02-18 17:25:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:21,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83789069] [2023-02-18 17:25:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:21,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:21,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403761238] [2023-02-18 17:25:21,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:21,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:21,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:21,068 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 17:25:21,085 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 17:25:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:21,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 17:25:21,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:21,230 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 17:25:21,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:25:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-18 17:25:23,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:23,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83789069] [2023-02-18 17:25:23,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:23,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403761238] [2023-02-18 17:25:23,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403761238] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 17:25:23,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:25:23,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2023-02-18 17:25:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047110360] [2023-02-18 17:25:23,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:25:23,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 17:25:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:23,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 17:25:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:25:23,198 INFO L87 Difference]: Start difference. First operand 52 states and 65 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 17:25:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:23,268 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2023-02-18 17:25:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 17:25:23,268 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2023-02-18 17:25:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:23,269 INFO L225 Difference]: With dead ends: 75 [2023-02-18 17:25:23,269 INFO L226 Difference]: Without dead ends: 73 [2023-02-18 17:25:23,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-18 17:25:23,269 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:25:23,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 130 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:25:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-18 17:25:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-18 17:25:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 44 states have internal predecessors, (52), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 17:25:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2023-02-18 17:25:23,277 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 43 [2023-02-18 17:25:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:23,277 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2023-02-18 17:25:23,278 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 17:25:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2023-02-18 17:25:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-18 17:25:23,278 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:23,278 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 17:25:23,285 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 17:25:23,482 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 17:25:23,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1189241395, now seen corresponding path program 1 times [2023-02-18 17:25:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:23,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999169792] [2023-02-18 17:25:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:23,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:23,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630274251] [2023-02-18 17:25:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:23,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:23,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:23,495 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 17:25:23,496 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 17:25:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:23,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 17:25:23,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 17:25:23,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:25:23,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:23,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999169792] [2023-02-18 17:25:23,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:23,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630274251] [2023-02-18 17:25:23,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630274251] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 17:25:23,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:25:23,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-18 17:25:23,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42892601] [2023-02-18 17:25:23,681 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 17:25:23,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 17:25:23,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:23,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 17:25:23,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-02-18 17:25:23,683 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 17:25:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:23,874 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2023-02-18 17:25:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 17:25:23,874 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2023-02-18 17:25:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:23,875 INFO L225 Difference]: With dead ends: 129 [2023-02-18 17:25:23,875 INFO L226 Difference]: Without dead ends: 75 [2023-02-18 17:25:23,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2023-02-18 17:25:23,876 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:25:23,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 145 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:25:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-18 17:25:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2023-02-18 17:25:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-18 17:25:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2023-02-18 17:25:23,884 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 48 [2023-02-18 17:25:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:23,884 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2023-02-18 17:25:23,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 17:25:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2023-02-18 17:25:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-18 17:25:23,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:23,885 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 17:25:23,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 17:25:24,086 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 17:25:24,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash -828341661, now seen corresponding path program 1 times [2023-02-18 17:25:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:24,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955946096] [2023-02-18 17:25:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:24,108 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:24,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776340580] [2023-02-18 17:25:24,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:24,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:24,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:24,127 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 17:25:24,128 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 17:25:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:24,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-18 17:25:24,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:24,313 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 17:25:24,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:25:24,637 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 17:25:24,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:24,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955946096] [2023-02-18 17:25:24,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:24,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776340580] [2023-02-18 17:25:24,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776340580] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:25:24,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:25:24,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2023-02-18 17:25:24,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301687203] [2023-02-18 17:25:24,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:25:24,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-18 17:25:24,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:24,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-18 17:25:24,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-02-18 17:25:24,639 INFO L87 Difference]: Start difference. First operand 72 states and 91 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 17:25:29,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 17:25:31,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 17:25:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:32,103 INFO L93 Difference]: Finished difference Result 214 states and 306 transitions. [2023-02-18 17:25:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-18 17:25:32,104 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 17:25:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:32,108 INFO L225 Difference]: With dead ends: 214 [2023-02-18 17:25:32,108 INFO L226 Difference]: Without dead ends: 181 [2023-02-18 17:25:32,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=440, Invalid=2212, Unknown=0, NotChecked=0, Total=2652 [2023-02-18 17:25:32,113 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 213 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-02-18 17:25:32,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 266 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-02-18 17:25:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-18 17:25:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 142. [2023-02-18 17:25:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 89 states have internal predecessors, (106), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-02-18 17:25:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2023-02-18 17:25:32,161 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 60 [2023-02-18 17:25:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:32,163 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2023-02-18 17:25:32,163 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 17:25:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2023-02-18 17:25:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 17:25:32,166 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:32,166 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 17:25:32,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 17:25:32,371 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 17:25:32,371 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2000413383, now seen corresponding path program 2 times [2023-02-18 17:25:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:32,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272349415] [2023-02-18 17:25:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:32,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:32,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:32,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600636568] [2023-02-18 17:25:32,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 17:25:32,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:32,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:32,402 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 17:25:32,404 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 17:25:32,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 17:25:32,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:25:32,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 17:25:32,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:32,459 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 17:25:32,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:25:32,487 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 17:25:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:32,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272349415] [2023-02-18 17:25:32,487 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:32,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600636568] [2023-02-18 17:25:32,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600636568] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:25:32,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:25:32,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-18 17:25:32,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200248867] [2023-02-18 17:25:32,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:25:32,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 17:25:32,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:32,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 17:25:32,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-18 17:25:32,489 INFO L87 Difference]: Start difference. First operand 142 states and 198 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 17:25:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:32,672 INFO L93 Difference]: Finished difference Result 215 states and 290 transitions. [2023-02-18 17:25:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 17:25:32,673 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 17:25:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:32,674 INFO L225 Difference]: With dead ends: 215 [2023-02-18 17:25:32,674 INFO L226 Difference]: Without dead ends: 144 [2023-02-18 17:25:32,674 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 17:25:32,675 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 75 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:25:32,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 206 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:25:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-18 17:25:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2023-02-18 17:25:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 87 states have internal predecessors, (99), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-02-18 17:25:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2023-02-18 17:25:32,719 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 65 [2023-02-18 17:25:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:32,719 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2023-02-18 17:25:32,719 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 17:25:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2023-02-18 17:25:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-18 17:25:32,720 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:25:32,720 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 17:25:32,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 17:25:32,922 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 17:25:32,922 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:25:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:25:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1382204855, now seen corresponding path program 1 times [2023-02-18 17:25:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:25:32,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438188301] [2023-02-18 17:25:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:25:32,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:25:32,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395463128] [2023-02-18 17:25:32,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:25:32,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:25:32,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:25:32,957 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 17:25:32,958 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 17:25:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:25:32,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 17:25:32,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:25:33,039 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 17:25:33,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:25:33,109 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 17:25:33,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:25:33,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438188301] [2023-02-18 17:25:33,110 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:25:33,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395463128] [2023-02-18 17:25:33,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395463128] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:25:33,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:25:33,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-18 17:25:33,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839029864] [2023-02-18 17:25:33,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:25:33,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 17:25:33,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:25:33,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 17:25:33,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-02-18 17:25:33,112 INFO L87 Difference]: Start difference. First operand 139 states and 188 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 17:25:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:25:33,229 INFO L93 Difference]: Finished difference Result 143 states and 191 transitions. [2023-02-18 17:25:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 17:25:33,230 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 17:25:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:25:33,230 INFO L225 Difference]: With dead ends: 143 [2023-02-18 17:25:33,230 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 17:25:33,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2023-02-18 17:25:33,232 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:25:33,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 136 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:25:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 17:25:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 17:25:33,233 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 17:25:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 17:25:33,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2023-02-18 17:25:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:25:33,233 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 17:25:33,233 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 17:25:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 17:25:33,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 17:25:33,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 17:25:33,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-18 17:25:33,440 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 17:25:33,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 17:25:33,458 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 73) the Hoare annotation is: (let ((.cse5 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse6 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse10 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse0 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse8 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse4 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse11 (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1)) (.cse2 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse12 (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (>= |ULTIMATE.start_main_~b~0#1| 0) .cse8 .cse9 .cse10 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse11 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) 1)) (and (>= |ULTIMATE.start_main_~b~0#1| 1) .cse0 .cse1 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse2 (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| 0) .cse3 .cse5 .cse6 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse7 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 1) .cse9 .cse12 (>= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1) .cse10) (let ((.cse13 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse14 (* |ULTIMATE.start_main_~s~0#1| (- 1)))) (and (= |ULTIMATE.start_main_~r~0#1| 1) .cse0 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse1 (or (and .cse8 .cse4 .cse11) .cse13) .cse2 .cse3 (= .cse14 1) (exists ((|ULTIMATE.start_main_~v~0#1| Int)) (let ((.cse15 (+ |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|))) (and (<= |ULTIMATE.start_main_~v~0#1| .cse15) (<= |ULTIMATE.start_main_~v~0#1| 1) (not (>= .cse15 (* 2 |ULTIMATE.start_main_~v~0#1|)))))) (= 0 |ULTIMATE.start_main_~b~0#1|) .cse13 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse14) |ULTIMATE.start_main_~q~0#1|) 1) (< (+ |ULTIMATE.start_main_~c~0#1| (- 1)) |ULTIMATE.start_main_~b~0#1|) .cse7 (<= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~a~0#1| 2) (- 1))) .cse9 .cse12 (<= |ULTIMATE.start_main_~b~0#1| (+ |ULTIMATE.start_main_~a~0#1| (- 1))) (= |ULTIMATE.start_main_~p~0#1| 0) (exists ((|ULTIMATE.start_main_~v~0#1| Int)) (let ((.cse16 (+ |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|))) (and (<= |ULTIMATE.start_main_~v~0#1| 1) (not (>= .cse16 (* 2 |ULTIMATE.start_main_~v~0#1|))) (<= |ULTIMATE.start_main_~v~0#1| .cse16)))) (= 0 |ULTIMATE.start_main_~c~0#1|))))) [2023-02-18 17:25:33,458 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 73) the Hoare annotation is: (let ((.cse17 (+ |ULTIMATE.start_main_~c~0#1| 1)) (.cse18 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse9 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse19 (< |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (let ((.cse0 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (let ((.cse21 (or (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|))) .cse19 (= 0 |ULTIMATE.start_main_~b~0#1|)))) (or (and .cse9 .cse21 .cse5 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (and .cse9 .cse21 .cse5)))) (.cse2 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse3 (or (and (<= |ULTIMATE.start_main_~c~0#1| 1) (>= |ULTIMATE.start_main_~c~0#1| 0) (<= .cse17 1)) .cse18)) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse7 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse8 (>= |ULTIMATE.start_main_~b~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse11 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) 1))) (or (let ((.cse6 (* |ULTIMATE.start_main_~s~0#1| (- 1)))) (and (= |ULTIMATE.start_main_~r~0#1| 1) .cse0 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 1) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse6) |ULTIMATE.start_main_~q~0#1|) 1) .cse7 .cse8 (<= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~a~0#1| 2) (- 1))) (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| 0) .cse11)) (let ((.cse14 (not (= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~s~0#1|))))) (.cse16 (* |ULTIMATE.start_main_~b~0#1| 2)) (.cse12 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse13 (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (+ (+ (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|) (- .cse12)) (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (- .cse13)) |ULTIMATE.start_main_~a~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or .cse14 (= (let ((.cse15 (+ |ULTIMATE.start_main_~k~0#1| 1))) (+ (+ (+ .cse12 (- (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) .cse15 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~x~0#1|))) .cse13) (- (* (+ |ULTIMATE.start_main_~r~0#1| (- (* |ULTIMATE.start_main_~s~0#1| .cse15))) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~b~0#1|) (< .cse16 .cse17) (not .cse18)) .cse7 .cse8 .cse9 .cse10 (or .cse14 .cse19 (< (+ .cse16 (- 1)) |ULTIMATE.start_main_~b~0#1|) (= (let ((.cse20 (+ 0 1))) (+ (+ (+ .cse12 (- (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) .cse20 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~x~0#1|))) .cse13) (- (* (+ |ULTIMATE.start_main_~r~0#1| (- (* |ULTIMATE.start_main_~s~0#1| .cse20))) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~b~0#1|)) .cse11))))) [2023-02-18 17:25:33,459 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse2 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse7 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse9 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse8 (>= |ULTIMATE.start_main_~x~0#1| 1))) (and .cse0 (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) .cse2 .cse3 (= |ULTIMATE.start_main_~r~0#1| 0) (<= |ULTIMATE.start_main_~v~0#1| 1) .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~k~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse8 .cse9 .cse10 (let ((.cse14 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse17 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse15 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse11 (>= |ULTIMATE.start_main_~b~0#1| 1)) (.cse12 (let ((.cse18 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse20 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse19 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse21 (let ((.cse22 (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse23 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse24 (let ((.cse25 (or .cse15 (and (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse15))) (.cse26 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse27 (<= 1 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse25 .cse26 .cse8 .cse27 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (and .cse25 .cse26 .cse8 .cse27))))) (or (and .cse6 .cse0 .cse7 .cse22 .cse23 .cse24 .cse3 .cse15 .cse9) (and .cse6 .cse0 .cse7 .cse22 .cse23 .cse24 .cse3 .cse15 .cse9 .cse17))))) (or (and .cse0 .cse7 .cse1 .cse14 (or (and .cse18 .cse19 (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1)) .cse5) .cse2 .cse20 .cse21 .cse10) (and .cse0 .cse7 .cse18 .cse1 .cse14 .cse2 .cse20 .cse19 .cse21 .cse10)))) (.cse13 (not (= 0 |ULTIMATE.start_main_~b~0#1|))) (.cse16 (= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|))) (or (and .cse11 .cse12 .cse0 .cse7 .cse13 .cse14 .cse15 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)) .cse16 .cse4 .cse5 .cse17) (and .cse11 .cse12 .cse0 .cse7 .cse13 .cse14 .cse15 .cse16 .cse4 .cse5 .cse17)))))) [2023-02-18 17:25:33,459 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 18 76) the Hoare annotation is: true [2023-02-18 17:25:33,459 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2023-02-18 17:25:33,459 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 17:25:33,459 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 17:25:33,459 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1)) [2023-02-18 17:25:33,459 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 1) (>= |ULTIMATE.start_main_~y~0#1| 0)) [2023-02-18 17:25:33,459 INFO L899 garLoopResultBuilder]: For program point L53(lines 49 59) no Hoare annotation was computed. [2023-02-18 17:25:33,460 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 59) the Hoare annotation is: (let ((.cse9 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse4 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse8 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse10 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse18 (= |ULTIMATE.start_main_~s~0#1| 1))) (and (>= |ULTIMATE.start_main_~b~0#1| 1) .cse0 (<= |ULTIMATE.start_main_~v~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| 1) .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (not (= 0 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse5 (= |ULTIMATE.start_main_~p~0#1| 1) .cse6 .cse7 (= |ULTIMATE.start_main_~r~0#1| 0) .cse8 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)) (= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse9 (let ((.cse11 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse13 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse12 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse14 (let ((.cse15 (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse17 (let ((.cse19 (or .cse8 (and (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse8))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse22 (<= 1 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse19 .cse20 .cse21 .cse22 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (and .cse19 .cse20 .cse21 .cse22))))) (or (and .cse2 .cse0 .cse10 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18) (and .cse2 .cse0 .cse10 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18 .cse1))))) (or (and .cse0 .cse10 .cse5 .cse3 (or (and .cse11 .cse12 (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1)) .cse9) .cse6 .cse13 .cse14 .cse4) (and .cse0 .cse10 .cse11 .cse5 .cse3 .cse6 .cse13 .cse12 .cse14 .cse4))) .cse10 (= |ULTIMATE.start_main_~k~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse21 .cse18)) [2023-02-18 17:25:33,460 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 59) no Hoare annotation was computed. [2023-02-18 17:25:33,460 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-02-18 17:25:33,460 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 17:25:33,460 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 1) (>= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~x~0#1| 1)) [2023-02-18 17:25:33,460 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse9 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse4 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse8 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse10 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse18 (= |ULTIMATE.start_main_~s~0#1| 1))) (and (>= |ULTIMATE.start_main_~b~0#1| 1) .cse0 (<= |ULTIMATE.start_main_~v~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| 1) .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (not (= 0 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse5 (= |ULTIMATE.start_main_~p~0#1| 1) .cse6 .cse7 (= |ULTIMATE.start_main_~r~0#1| 0) .cse8 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)) (= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse9 (let ((.cse11 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse13 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse12 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse14 (let ((.cse15 (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse17 (let ((.cse19 (or .cse8 (and (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse8))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse22 (<= 1 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse19 .cse20 .cse21 .cse22 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (and .cse19 .cse20 .cse21 .cse22))))) (or (and .cse2 .cse0 .cse10 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18) (and .cse2 .cse0 .cse10 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18 .cse1))))) (or (and .cse0 .cse10 .cse5 .cse3 (or (and .cse11 .cse12 (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1)) .cse9) .cse6 .cse13 .cse14 .cse4) (and .cse0 .cse10 .cse11 .cse5 .cse3 .cse6 .cse13 .cse12 .cse14 .cse4))) .cse10 (= |ULTIMATE.start_main_~k~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse21 .cse18)) [2023-02-18 17:25:33,461 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse9 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse4 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse8 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse10 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse18 (= |ULTIMATE.start_main_~s~0#1| 1))) (and (>= |ULTIMATE.start_main_~b~0#1| 1) .cse0 (<= |ULTIMATE.start_main_~v~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| 1) .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (not (= 0 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse5 (= |ULTIMATE.start_main_~p~0#1| 1) .cse6 .cse7 (= |ULTIMATE.start_main_~r~0#1| 0) .cse8 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)) (= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse9 (let ((.cse11 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse13 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse12 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse14 (let ((.cse15 (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse17 (let ((.cse19 (or .cse8 (and (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse8))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse22 (<= 1 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse19 .cse20 .cse21 .cse22 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (and .cse19 .cse20 .cse21 .cse22))))) (or (and .cse2 .cse0 .cse10 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18) (and .cse2 .cse0 .cse10 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18 .cse1))))) (or (and .cse0 .cse10 .cse5 .cse3 (or (and .cse11 .cse12 (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1)) .cse9) .cse6 .cse13 .cse14 .cse4) (and .cse0 .cse10 .cse11 .cse5 .cse3 .cse6 .cse13 .cse12 .cse14 .cse4))) .cse10 (= |ULTIMATE.start_main_~k~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse21 .cse18)) [2023-02-18 17:25:33,461 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 17:25:33,461 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 62) the Hoare annotation is: (let ((.cse17 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (>= |ULTIMATE.start_main_~b~0#1| 1)) (.cse1 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse4 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse7 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse9 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse10 (not (= 0 |ULTIMATE.start_main_~b~0#1|))) (.cse11 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse12 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse13 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse18 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse19 (or .cse17 (and (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse17))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse22 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse23 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|) .cse2 (= |ULTIMATE.start_main_~d~0#1| 1) .cse3 (= |ULTIMATE.start_main_~k~0#1| 1) .cse4 (not (>= |ULTIMATE.start_main_~c~0#1| (* 2 |ULTIMATE.start_main_~v~0#1|))) .cse5 .cse6 .cse7 (exists ((|ULTIMATE.start_main_~v~0#1| Int)) (let ((.cse8 (+ |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|))) (and (<= |ULTIMATE.start_main_~v~0#1| 1) (not (>= .cse8 (* 2 |ULTIMATE.start_main_~v~0#1|))) (<= |ULTIMATE.start_main_~v~0#1| .cse8)))) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~b~0#1| 2) (- 1))) .cse12 .cse13 (exists ((|ULTIMATE.start_main_~k~0#1| Int) (|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse14 (+ |ULTIMATE.start_main_~a~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~b~0#1|)))) (and (>= .cse14 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 1) (<= .cse14 |ULTIMATE.start_main_~a~0#1|)))) .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~b~0#1|) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= 0 |ULTIMATE.start_main_~c~0#1|)) (and .cse0 .cse1 (>= |ULTIMATE.start_main_~c~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)) .cse18 (<= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~k~0#1| 0) .cse19 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse20 .cse21 .cse22 .cse23)))) [2023-02-18 17:25:33,462 INFO L899 garLoopResultBuilder]: For program point L42-3(lines 42 62) no Hoare annotation was computed. [2023-02-18 17:25:33,462 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-18 17:25:33,462 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2023-02-18 17:25:33,462 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-18 17:25:33,463 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse9 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse4 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse8 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse10 (<= |ULTIMATE.start_main_~x~0#1| 1)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse18 (= |ULTIMATE.start_main_~s~0#1| 1))) (and (>= |ULTIMATE.start_main_~b~0#1| 1) .cse0 (<= |ULTIMATE.start_main_~v~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| 1) .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~c~0#1|) (not (= 0 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse5 (= |ULTIMATE.start_main_~p~0#1| 1) .cse6 .cse7 (= |ULTIMATE.start_main_~r~0#1| 0) .cse8 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)) (= |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~b~0#1|) .cse9 (let ((.cse11 (<= |ULTIMATE.start_main_~c~0#1| 1)) (.cse13 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse12 (>= |ULTIMATE.start_main_~c~0#1| 0)) (.cse14 (let ((.cse15 (<= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse17 (let ((.cse19 (or .cse8 (and (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse8))) (.cse20 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse22 (<= 1 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse19 .cse20 .cse21 .cse22 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (and .cse19 .cse20 .cse21 .cse22))))) (or (and .cse2 .cse0 .cse10 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18) (and .cse2 .cse0 .cse10 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18 .cse1))))) (or (and .cse0 .cse10 .cse5 .cse3 (or (and .cse11 .cse12 (<= (+ |ULTIMATE.start_main_~c~0#1| 1) 1)) .cse9) .cse6 .cse13 .cse14 .cse4) (and .cse0 .cse10 .cse11 .cse5 .cse3 .cse6 .cse13 .cse12 .cse14 .cse4))) .cse10 (= |ULTIMATE.start_main_~k~0#1| 0) (<= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse21 .cse18)) [2023-02-18 17:25:33,463 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2023-02-18 17:25:33,463 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-02-18 17:25:33,463 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-18 17:25:33,463 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-02-18 17:25:33,463 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-02-18 17:25:33,463 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2023-02-18 17:25:33,463 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2023-02-18 17:25:33,464 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2023-02-18 17:25:33,464 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 16) the Hoare annotation is: true [2023-02-18 17:25:33,464 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2023-02-18 17:25:33,464 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-02-18 17:25:33,467 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:25:33,469 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 17:25:33,476 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] [2023-02-18 17:25:33,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] [2023-02-18 17:25:33,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] [2023-02-18 17:25:33,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] [2023-02-18 17:25:33,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,502 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,507 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 05:25:33 BoogieIcfgContainer [2023-02-18 17:25:33,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 17:25:33,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 17:25:33,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 17:25:33,511 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 17:25:33,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:25:17" (3/4) ... [2023-02-18 17:25:33,513 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 17:25:33,517 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 17:25:33,517 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 17:25:33,521 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 17:25:33,521 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 17:25:33,521 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 17:25:33,521 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 17:25:33,539 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((x >= 0 && y <= 1) && y >= 0) && y >= 1) && c >= 0) && 1 <= a) && 1 <= b) && x <= 1) && b >= 0) && c <= 1) && x >= 1) && b <= 1) && 1 <= c) && c + 1 <= 1) && b + 1 <= 1) || (((((((((((((((((((b >= 1 && x >= 0) && y <= 1) && a == x) && y >= 0) && p == 1) && q == 0) && r == 0) && y >= 1) && 1 <= a) && 1 <= b) && b == y) && x <= 1) && a == y * r + x * p) && a <= 1) && x >= 1) && a <= x) && a >= 0) && s == 1) && b <= 1)) || ((((((((((((((((((((r == 1 && x >= 0) && a == y) && y <= 1) && (((c <= 1 && c >= 0) && c + 1 <= 1) || c >= b)) && y >= 0) && y >= 1) && s * -1 == 1) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= ULTIMATE.start_main_~v~0#1 + b && ULTIMATE.start_main_~v~0#1 <= 1) && !(ULTIMATE.start_main_~v~0#1 + b >= 2 * ULTIMATE.start_main_~v~0#1))) && 0 == b) && c >= b) && p * (s * -1) + q == 1) && c + -1 < b) && x <= 1) && a <= a * 2 + -1) && x >= 1) && a <= x) && b <= a + -1) && p == 0) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= 1 && !(ULTIMATE.start_main_~v~0#1 + c >= 2 * ULTIMATE.start_main_~v~0#1)) && ULTIMATE.start_main_~v~0#1 <= ULTIMATE.start_main_~v~0#1 + c)) && 0 == c) [2023-02-18 17:25:33,540 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((b >= 1 && x >= 0) && b <= a) && 1 <= a) && d == 1) && c <= a) && k == 1) && b == y) && !(c >= 2 * v)) && a <= 1) && a <= x) && b <= 1) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= 1 && !(ULTIMATE.start_main_~v~0#1 + c >= 2 * ULTIMATE.start_main_~v~0#1)) && ULTIMATE.start_main_~v~0#1 <= ULTIMATE.start_main_~v~0#1 + c)) && v <= b) && b <= x) && y <= 1) && !(0 == b)) && a == x) && b <= b * 2 + -1) && y >= 0) && p == 1) && (\exists ULTIMATE.start_main_~k~0#1 : int, ULTIMATE.start_main_~a~0#1 : int :: (ULTIMATE.start_main_~a~0#1 + -1 * ULTIMATE.start_main_~k~0#1 * b >= b && ULTIMATE.start_main_~a~0#1 <= 1) && ULTIMATE.start_main_~a~0#1 + -1 * ULTIMATE.start_main_~k~0#1 * b <= ULTIMATE.start_main_~a~0#1)) && q == 0) && r == 0) && y >= 1) && v == b) && c + 1 <= b) && x <= 1) && (y >= 1 || (1 <= b && y >= 1))) && a == y * r + x * p) && x >= 1) && a >= 0) && s == 1) && 0 == c) || (((((((((((((((((((((((((((b >= 1 && x >= 0) && c >= 0) && 1 <= a) && c <= a) && b == y) && a <= 1) && a <= x) && b <= 1) && 1 <= c) && y <= 1) && !(0 == b)) && a == x) && y >= 0) && p == 1) && q == 0) && r == 0) && y >= 1) && a == k * b + c) && x <= 1) && c <= 1) && k == 0) && (y >= 1 || (1 <= b && y >= 1))) && c <= x) && a == y * r + x * p) && x >= 1) && a >= 0) && s == 1) [2023-02-18 17:25:33,552 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 17:25:33,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 17:25:33,553 INFO L158 Benchmark]: Toolchain (without parser) took 16400.94ms. Allocated memory was 144.7MB in the beginning and 226.5MB in the end (delta: 81.8MB). Free memory was 114.6MB in the beginning and 107.5MB in the end (delta: 7.1MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2023-02-18 17:25:33,553 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 17:25:33,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.16ms. Allocated memory is still 144.7MB. Free memory was 114.3MB in the beginning and 103.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 17:25:33,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.40ms. Allocated memory is still 144.7MB. Free memory was 103.7MB in the beginning and 102.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 17:25:33,556 INFO L158 Benchmark]: Boogie Preprocessor took 31.53ms. Allocated memory is still 144.7MB. Free memory was 102.0MB in the beginning and 100.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 17:25:33,556 INFO L158 Benchmark]: RCFGBuilder took 255.33ms. Allocated memory is still 144.7MB. Free memory was 100.9MB in the beginning and 89.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 17:25:33,557 INFO L158 Benchmark]: TraceAbstraction took 15896.27ms. Allocated memory was 144.7MB in the beginning and 226.5MB in the end (delta: 81.8MB). Free memory was 89.1MB in the beginning and 110.7MB in the end (delta: -21.6MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2023-02-18 17:25:33,557 INFO L158 Benchmark]: Witness Printer took 41.96ms. Allocated memory is still 226.5MB. Free memory was 110.7MB in the beginning and 107.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 17:25:33,558 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 117.4MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.16ms. Allocated memory is still 144.7MB. Free memory was 114.3MB in the beginning and 103.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.40ms. Allocated memory is still 144.7MB. Free memory was 103.7MB in the beginning and 102.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.53ms. Allocated memory is still 144.7MB. Free memory was 102.0MB in the beginning and 100.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 255.33ms. Allocated memory is still 144.7MB. Free memory was 100.9MB in the beginning and 89.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15896.27ms. Allocated memory was 144.7MB in the beginning and 226.5MB in the end (delta: 81.8MB). Free memory was 89.1MB in the beginning and 110.7MB in the end (delta: -21.6MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * Witness Printer took 41.96ms. Allocated memory is still 226.5MB. Free memory was 110.7MB in the beginning and 107.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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_~a~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~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_~a~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~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: 15.8s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 694 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 656 mSDsluCounter, 1701 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1290 mSDsCounter, 498 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2668 IncrementalHoareTripleChecker+Invalid, 3166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 498 mSolverCounterUnsat, 411 mSDtfsCounter, 2668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 681 SyntacticMatches, 15 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=9, InterpolantAutomatonStates: 131, 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, 11 MinimizatonAttempts, 103 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 124 PreInvPairs, 140 NumberOfFragments, 3808 HoareAnnotationTreeSize, 124 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 811 ConstructedInterpolants, 8 QuantifiedInterpolants, 3968 SizeOfPredicates, 82 NumberOfNonLiveVariables, 1398 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 645/764 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 17:25:33,577 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,578 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,579 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,579 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,579 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,579 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,579 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] [2023-02-18 17:25:33,579 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,579 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] [2023-02-18 17:25:33,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] [2023-02-18 17:25:33,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] [2023-02-18 17:25:33,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0#1,QUANTIFIED] [2023-02-18 17:25:33,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0#1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((b >= 1 && x >= 0) && b <= a) && 1 <= a) && d == 1) && c <= a) && k == 1) && b == y) && !(c >= 2 * v)) && a <= 1) && a <= x) && b <= 1) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= 1 && !(ULTIMATE.start_main_~v~0#1 + c >= 2 * ULTIMATE.start_main_~v~0#1)) && ULTIMATE.start_main_~v~0#1 <= ULTIMATE.start_main_~v~0#1 + c)) && v <= b) && b <= x) && y <= 1) && !(0 == b)) && a == x) && b <= b * 2 + -1) && y >= 0) && p == 1) && (\exists ULTIMATE.start_main_~k~0#1 : int, ULTIMATE.start_main_~a~0#1 : int :: (ULTIMATE.start_main_~a~0#1 + -1 * ULTIMATE.start_main_~k~0#1 * b >= b && ULTIMATE.start_main_~a~0#1 <= 1) && ULTIMATE.start_main_~a~0#1 + -1 * ULTIMATE.start_main_~k~0#1 * b <= ULTIMATE.start_main_~a~0#1)) && q == 0) && r == 0) && y >= 1) && v == b) && c + 1 <= b) && x <= 1) && (y >= 1 || (1 <= b && y >= 1))) && a == y * r + x * p) && x >= 1) && a >= 0) && s == 1) && 0 == c) || (((((((((((((((((((((((((((b >= 1 && x >= 0) && c >= 0) && 1 <= a) && c <= a) && b == y) && a <= 1) && a <= x) && b <= 1) && 1 <= c) && y <= 1) && !(0 == b)) && a == x) && y >= 0) && p == 1) && q == 0) && r == 0) && y >= 1) && a == k * b + c) && x <= 1) && c <= 1) && k == 0) && (y >= 1 || (1 <= b && y >= 1))) && c <= x) && a == y * r + x * p) && x >= 1) && a >= 0) && s == 1) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((b >= 1 && x >= 0) && v <= 1) && d == 1) && c <= a) && b == y) && a <= 1) && b <= 1) && v <= b) && v <= c) && !(0 == b)) && a == x) && y <= 1) && p == 1) && y >= 0) && q == 0) && r == 0) && y >= 1) && a == k * b + c) && v == b) && c >= b) && (((((((((x >= 0 && x <= 1) && y <= 1) && a <= 1) && (((c <= 1 && c >= 0) && c + 1 <= 1) || c >= b)) && y >= 0) && a >= 0) && (((((((((b == y && x >= 0) && x <= 1) && a <= x) && b <= a) && ((((((y >= 1 || (1 <= b && y >= 1)) && a == y * r + x * p) && x >= 1) && 1 <= a) && 1 <= c) || ((((y >= 1 || (1 <= b && y >= 1)) && a == y * r + x * p) && x >= 1) && 1 <= a))) && q == 0) && y >= 1) && s == 1) || (((((((((b == y && x >= 0) && x <= 1) && a <= x) && b <= a) && ((((((y >= 1 || (1 <= b && y >= 1)) && a == y * r + x * p) && x >= 1) && 1 <= a) && 1 <= c) || ((((y >= 1 || (1 <= b && y >= 1)) && a == y * r + x * p) && x >= 1) && 1 <= a))) && q == 0) && y >= 1) && s == 1) && c <= a))) && b <= 1) || (((((((((x >= 0 && x <= 1) && c <= 1) && y <= 1) && a <= 1) && y >= 0) && a >= 0) && c >= 0) && (((((((((b == y && x >= 0) && x <= 1) && a <= x) && b <= a) && ((((((y >= 1 || (1 <= b && y >= 1)) && a == y * r + x * p) && x >= 1) && 1 <= a) && 1 <= c) || ((((y >= 1 || (1 <= b && y >= 1)) && a == y * r + x * p) && x >= 1) && 1 <= a))) && q == 0) && y >= 1) && s == 1) || (((((((((b == y && x >= 0) && x <= 1) && a <= x) && b <= a) && ((((((y >= 1 || (1 <= b && y >= 1)) && a == y * r + x * p) && x >= 1) && 1 <= a) && 1 <= c) || ((((y >= 1 || (1 <= b && y >= 1)) && a == y * r + x * p) && x >= 1) && 1 <= a))) && q == 0) && y >= 1) && s == 1) && c <= a))) && b <= 1))) && x <= 1) && k == 0) && c <= x) && x >= 1) && s == 1 - InvariantResult [Line: 35]: Loop Invariant [2023-02-18 17:25:33,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] [2023-02-18 17:25:33,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~v~0#1,QUANTIFIED] Derived loop invariant: (((((((((((((((x >= 0 && y <= 1) && y >= 0) && y >= 1) && c >= 0) && 1 <= a) && 1 <= b) && x <= 1) && b >= 0) && c <= 1) && x >= 1) && b <= 1) && 1 <= c) && c + 1 <= 1) && b + 1 <= 1) || (((((((((((((((((((b >= 1 && x >= 0) && y <= 1) && a == x) && y >= 0) && p == 1) && q == 0) && r == 0) && y >= 1) && 1 <= a) && 1 <= b) && b == y) && x <= 1) && a == y * r + x * p) && a <= 1) && x >= 1) && a <= x) && a >= 0) && s == 1) && b <= 1)) || ((((((((((((((((((((r == 1 && x >= 0) && a == y) && y <= 1) && (((c <= 1 && c >= 0) && c + 1 <= 1) || c >= b)) && y >= 0) && y >= 1) && s * -1 == 1) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= ULTIMATE.start_main_~v~0#1 + b && ULTIMATE.start_main_~v~0#1 <= 1) && !(ULTIMATE.start_main_~v~0#1 + b >= 2 * ULTIMATE.start_main_~v~0#1))) && 0 == b) && c >= b) && p * (s * -1) + q == 1) && c + -1 < b) && x <= 1) && a <= a * 2 + -1) && x >= 1) && a <= x) && b <= a + -1) && p == 0) && (\exists ULTIMATE.start_main_~v~0#1 : int :: (ULTIMATE.start_main_~v~0#1 <= 1 && !(ULTIMATE.start_main_~v~0#1 + c >= 2 * ULTIMATE.start_main_~v~0#1)) && ULTIMATE.start_main_~v~0#1 <= ULTIMATE.start_main_~v~0#1 + c)) && 0 == c) RESULT: Ultimate proved your program to be correct! [2023-02-18 17:25:33,599 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