./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_1.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/bitvector/num_conversion_1.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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:43:45,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:43:45,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:43:45,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:43:45,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:43:45,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:43:45,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:43:45,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:43:45,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:43:45,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:43:45,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:43:45,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:43:45,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:43:45,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:43:45,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:43:45,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:43:45,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:43:45,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:43:45,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:43:45,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:43:45,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:43:45,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:43:45,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:43:45,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:43:45,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:43:45,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:43:45,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:43:45,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:43:45,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:43:45,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:43:45,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:43:45,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:43:45,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:43:45,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:43:45,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:43:45,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:43:45,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:43:45,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:43:45,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:43:45,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:43:45,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:43:45,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 05:43:45,817 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:43:45,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:43:45,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:43:45,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:43:45,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:43:45,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:43:45,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:43:45,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:43:45,823 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:43:45,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:43:45,824 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:43:45,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 05:43:45,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:43:45,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:43:45,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:43:45,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:43:45,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:43:45,825 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:43:45,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:43:45,825 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:43:45,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:43:45,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:43:45,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:43:45,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:43:45,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:43:45,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:43:45,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:43:45,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:43:45,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 05:43:45,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 05:43:45,827 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:43:45,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:43:45,827 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:43:45,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:43:45,828 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:43:45,828 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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2023-02-17 05:43:46,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:43:46,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:43:46,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:43:46,037 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:43:46,038 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:43:46,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-17 05:43:47,072 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:43:47,235 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:43:47,235 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-17 05:43:47,239 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453305e66/8f7d963d353e4bfb8938644aa6a72584/FLAG5e467cdf5 [2023-02-17 05:43:47,253 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453305e66/8f7d963d353e4bfb8938644aa6a72584 [2023-02-17 05:43:47,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:43:47,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:43:47,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:43:47,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:43:47,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:43:47,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584800e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47, skipping insertion in model container [2023-02-17 05:43:47,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:43:47,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:43:47,388 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/bitvector/num_conversion_1.c[673,686] [2023-02-17 05:43:47,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:43:47,403 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:43:47,410 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/bitvector/num_conversion_1.c[673,686] [2023-02-17 05:43:47,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:43:47,422 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:43:47,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47 WrapperNode [2023-02-17 05:43:47,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:43:47,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:43:47,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:43:47,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:43:47,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,442 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-02-17 05:43:47,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:43:47,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:43:47,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:43:47,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:43:47,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,453 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:43:47,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:43:47,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:43:47,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:43:47,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (1/1) ... [2023-02-17 05:43:47,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:43:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:43:47,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 05:43:47,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 05:43:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:43:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:43:47,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:43:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 05:43:47,572 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:43:47,573 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:43:47,697 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:43:47,701 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:43:47,705 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 05:43:47,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:43:47 BoogieIcfgContainer [2023-02-17 05:43:47,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:43:47,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:43:47,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:43:47,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:43:47,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:43:47" (1/3) ... [2023-02-17 05:43:47,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c104e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:43:47, skipping insertion in model container [2023-02-17 05:43:47,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:47" (2/3) ... [2023-02-17 05:43:47,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c104e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:43:47, skipping insertion in model container [2023-02-17 05:43:47,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:43:47" (3/3) ... [2023-02-17 05:43:47,712 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2023-02-17 05:43:47,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:43:47,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:43:47,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:43:47,770 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;@23e927a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:43:47,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:43:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 05:43:47,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:47,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 05:43:47,778 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:47,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2023-02-17 05:43:47,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:43:47,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314278134] [2023-02-17 05:43:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:47,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:43:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:47,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:43:47,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314278134] [2023-02-17 05:43:47,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314278134] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:43:47,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:43:47,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 05:43:47,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394357126] [2023-02-17 05:43:47,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:43:47,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 05:43:47,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:43:47,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 05:43:47,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 05:43:47,958 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:47,968 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-02-17 05:43:47,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 05:43:47,970 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2023-02-17 05:43:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:47,975 INFO L225 Difference]: With dead ends: 21 [2023-02-17 05:43:47,975 INFO L226 Difference]: Without dead ends: 9 [2023-02-17 05:43:47,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 05:43:47,981 INFO L413 NwaCegarLoop]: 14 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, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:47,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-02-17 05:43:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-17 05:43:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-02-17 05:43:48,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-02-17 05:43:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:48,004 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-02-17 05:43:48,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-02-17 05:43:48,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 05:43:48,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:48,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 05:43:48,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 05:43:48,006 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2023-02-17 05:43:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:43:48,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511928508] [2023-02-17 05:43:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:43:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:43:48,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511928508] [2023-02-17 05:43:48,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511928508] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:43:48,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:43:48,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:43:48,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744210083] [2023-02-17 05:43:48,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:43:48,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:43:48,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:43:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:43:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:43:48,073 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:48,084 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-02-17 05:43:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:43:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-02-17 05:43:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:48,085 INFO L225 Difference]: With dead ends: 16 [2023-02-17 05:43:48,085 INFO L226 Difference]: Without dead ends: 12 [2023-02-17 05:43:48,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:43:48,086 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:48,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-02-17 05:43:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2023-02-17 05:43:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-02-17 05:43:48,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-02-17 05:43:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:48,093 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-02-17 05:43:48,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-02-17 05:43:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 05:43:48,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:48,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:48,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 05:43:48,095 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:48,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2023-02-17 05:43:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:43:48,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678212024] [2023-02-17 05:43:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:43:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:48,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:43:48,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678212024] [2023-02-17 05:43:48,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678212024] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:43:48,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924364378] [2023-02-17 05:43:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:48,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:43:48,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:43:48,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:43:48,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 05:43:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:48,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 05:43:48,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:48,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:48,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924364378] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:48,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:43:48,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 8 [2023-02-17 05:43:48,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938445570] [2023-02-17 05:43:48,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:48,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 05:43:48,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:43:48,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 05:43:48,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-17 05:43:48,371 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:48,417 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2023-02-17 05:43:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 05:43:48,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) Word has length 9 [2023-02-17 05:43:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:48,418 INFO L225 Difference]: With dead ends: 23 [2023-02-17 05:43:48,418 INFO L226 Difference]: Without dead ends: 19 [2023-02-17 05:43:48,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2023-02-17 05:43:48,420 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:48,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-17 05:43:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-17 05:43:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-17 05:43:48,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2023-02-17 05:43:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:48,424 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-17 05:43:48,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-17 05:43:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 05:43:48,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:48,425 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:48,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 05:43:48,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:43:48,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:48,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2023-02-17 05:43:48,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:43:48,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411853069] [2023-02-17 05:43:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:43:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:48,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:43:48,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411853069] [2023-02-17 05:43:48,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411853069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:43:48,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870853068] [2023-02-17 05:43:48,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 05:43:48,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:43:48,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:43:48,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:43:48,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 05:43:48,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 05:43:48,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:43:48,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 05:43:48,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:49,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:49,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870853068] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:49,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:43:49,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-02-17 05:43:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572876595] [2023-02-17 05:43:49,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:49,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 05:43:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:43:49,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 05:43:49,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2023-02-17 05:43:49,123 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:49,218 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-02-17 05:43:49,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 05:43:49,219 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 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) Word has length 18 [2023-02-17 05:43:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:49,220 INFO L225 Difference]: With dead ends: 35 [2023-02-17 05:43:49,220 INFO L226 Difference]: Without dead ends: 31 [2023-02-17 05:43:49,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2023-02-17 05:43:49,223 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:49,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 104 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:43:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-17 05:43:49,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-17 05:43:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-02-17 05:43:49,234 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2023-02-17 05:43:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:49,234 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-02-17 05:43:49,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-02-17 05:43:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 05:43:49,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:49,236 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:49,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 05:43:49,441 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,SelfDestructingSolverStorable3 [2023-02-17 05:43:49,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 3 times [2023-02-17 05:43:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:43:49,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453380364] [2023-02-17 05:43:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:43:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 05:43:49,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 05:43:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 05:43:49,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 05:43:49,509 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 05:43:49,509 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 05:43:49,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 05:43:49,513 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-02-17 05:43:49,515 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 05:43:49,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 05:43:49 BoogieIcfgContainer [2023-02-17 05:43:49,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 05:43:49,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 05:43:49,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 05:43:49,533 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 05:43:49,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:43:47" (3/4) ... [2023-02-17 05:43:49,535 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-17 05:43:49,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 05:43:49,535 INFO L158 Benchmark]: Toolchain (without parser) took 2278.06ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 118.1MB in the end (delta: -9.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:43:49,536 INFO L158 Benchmark]: CDTParser took 5.97ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 69.2MB in the beginning and 131.0MB in the end (delta: -61.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:43:49,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.81ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 98.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 05:43:49,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.14ms. Allocated memory is still 155.2MB. Free memory was 98.4MB in the beginning and 97.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:43:49,536 INFO L158 Benchmark]: Boogie Preprocessor took 12.37ms. Allocated memory is still 155.2MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:43:49,537 INFO L158 Benchmark]: RCFGBuilder took 250.80ms. Allocated memory is still 155.2MB. Free memory was 96.0MB in the beginning and 86.7MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 05:43:49,537 INFO L158 Benchmark]: TraceAbstraction took 1824.45ms. Allocated memory is still 155.2MB. Free memory was 85.9MB in the beginning and 118.1MB in the end (delta: -32.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:43:49,537 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 155.2MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:43:49,538 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 5.97ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 69.2MB in the beginning and 131.0MB in the end (delta: -61.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.81ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 98.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.14ms. Allocated memory is still 155.2MB. Free memory was 98.4MB in the beginning and 97.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.37ms. Allocated memory is still 155.2MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 250.80ms. Allocated memory is still 155.2MB. Free memory was 96.0MB in the beginning and 86.7MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1824.45ms. Allocated memory is still 155.2MB. Free memory was 85.9MB in the beginning and 118.1MB in the end (delta: -32.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 155.2MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 32, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L24] unsigned char x; [L25] unsigned char y; [L26] unsigned char c; [L28] x = 37 [L29] y = 0 [L30] c = 0 VAL [c=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=0, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=0, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=1, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=1, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=1, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=2, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=2, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=2, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=3, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=3, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=3, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=4, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=4, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=4, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=5, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=5, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=5, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=6, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=6, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=6, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=7, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=7, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=7, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=8, i=1, x=37, y=0] [L31] COND FALSE !(c < (unsigned char)8) VAL [bit=0, c=8, i=1, x=37, y=0] [L39] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 48 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 404 SizeOfPredicates, 5 NumberOfNonLiveVariables, 113 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/69 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-17 05:43:49,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/num_conversion_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:43:51,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:43:51,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:43:51,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:43:51,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:43:51,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:43:51,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:43:51,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:43:51,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:43:51,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:43:51,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:43:51,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:43:51,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:43:51,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:43:51,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:43:51,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:43:51,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:43:51,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:43:51,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:43:51,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:43:51,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:43:51,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:43:51,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:43:51,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:43:51,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:43:51,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:43:51,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:43:51,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:43:51,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:43:51,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:43:51,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:43:51,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:43:51,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:43:51,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:43:51,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:43:51,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:43:51,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:43:51,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:43:51,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:43:51,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:43:51,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:43:51,383 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-17 05:43:51,407 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:43:51,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:43:51,409 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:43:51,409 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:43:51,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:43:51,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:43:51,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:43:51,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:43:51,410 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:43:51,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:43:51,411 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:43:51,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:43:51,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:43:51,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:43:51,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:43:51,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:43:51,412 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 05:43:51,412 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 05:43:51,420 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 05:43:51,421 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:43:51,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:43:51,421 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:43:51,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:43:51,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:43:51,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:43:51,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:43:51,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:43:51,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:43:51,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:43:51,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:43:51,426 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 05:43:51,426 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 05:43:51,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:43:51,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:43:51,433 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:43:51,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:43:51,433 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 05:43:51,433 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:43:51,433 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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2023-02-17 05:43:51,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:43:51,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:43:51,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:43:51,777 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:43:51,777 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:43:51,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-17 05:43:53,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:43:53,202 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:43:53,203 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-17 05:43:53,207 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72af49525/1da36aa455b14cef8d4a14b0c87f92d5/FLAGdc6b87da6 [2023-02-17 05:43:53,220 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72af49525/1da36aa455b14cef8d4a14b0c87f92d5 [2023-02-17 05:43:53,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:43:53,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:43:53,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:43:53,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:43:53,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:43:53,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c2e2e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53, skipping insertion in model container [2023-02-17 05:43:53,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:43:53,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:43:53,352 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/bitvector/num_conversion_1.c[673,686] [2023-02-17 05:43:53,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:43:53,376 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:43:53,389 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/bitvector/num_conversion_1.c[673,686] [2023-02-17 05:43:53,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:43:53,406 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:43:53,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53 WrapperNode [2023-02-17 05:43:53,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:43:53,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:43:53,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:43:53,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:43:53,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,432 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-02-17 05:43:53,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:43:53,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:43:53,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:43:53,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:43:53,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,469 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:43:53,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:43:53,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:43:53,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:43:53,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (1/1) ... [2023-02-17 05:43:53,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:43:53,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:43:53,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 05:43:53,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 05:43:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:43:53,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:43:53,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:43:53,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 05:43:53,596 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:43:53,597 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:43:53,725 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:43:53,730 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:43:53,730 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 05:43:53,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:43:53 BoogieIcfgContainer [2023-02-17 05:43:53,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:43:53,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:43:53,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:43:53,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:43:53,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:43:53" (1/3) ... [2023-02-17 05:43:53,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6400c714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:43:53, skipping insertion in model container [2023-02-17 05:43:53,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:53" (2/3) ... [2023-02-17 05:43:53,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6400c714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:43:53, skipping insertion in model container [2023-02-17 05:43:53,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:43:53" (3/3) ... [2023-02-17 05:43:53,738 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2023-02-17 05:43:53,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:43:53,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:43:53,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:43:53,809 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;@2fd05ed3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:43:53,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:43:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 05:43:53,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:53,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 05:43:53,818 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:53,822 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2023-02-17 05:43:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:53,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992465053] [2023-02-17 05:43:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:53,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:53,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:53,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:53,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 05:43:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:53,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 05:43:53,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:53,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:43:53,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:53,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992465053] [2023-02-17 05:43:53,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992465053] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:43:53,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:43:53,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 05:43:53,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423716673] [2023-02-17 05:43:53,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:43:53,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 05:43:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 05:43:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 05:43:53,972 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:53,982 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-02-17 05:43:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 05:43:53,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2023-02-17 05:43:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:53,988 INFO L225 Difference]: With dead ends: 21 [2023-02-17 05:43:53,988 INFO L226 Difference]: Without dead ends: 9 [2023-02-17 05:43:53,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 05:43:53,992 INFO L413 NwaCegarLoop]: 14 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, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:53,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-02-17 05:43:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-17 05:43:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-02-17 05:43:54,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-02-17 05:43:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:54,016 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-02-17 05:43:54,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-02-17 05:43:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 05:43:54,017 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:54,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 05:43:54,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:54,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:54,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:54,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:54,225 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2023-02-17 05:43:54,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:54,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52484192] [2023-02-17 05:43:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:54,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:54,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:54,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:54,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 05:43:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:54,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 05:43:54,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:54,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:43:54,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:54,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52484192] [2023-02-17 05:43:54,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52484192] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:43:54,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:43:54,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:43:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115895033] [2023-02-17 05:43:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:43:54,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:43:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:54,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:43:54,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:43:54,269 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:54,282 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-02-17 05:43:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:43:54,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-02-17 05:43:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:54,283 INFO L225 Difference]: With dead ends: 16 [2023-02-17 05:43:54,283 INFO L226 Difference]: Without dead ends: 12 [2023-02-17 05:43:54,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:43:54,285 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:54,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-02-17 05:43:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2023-02-17 05:43:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-02-17 05:43:54,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-02-17 05:43:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:54,295 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-02-17 05:43:54,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-02-17 05:43:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 05:43:54,296 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:54,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:54,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:54,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:54,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2023-02-17 05:43:54,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:54,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171494946] [2023-02-17 05:43:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:54,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:54,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:54,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:54,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 05:43:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:54,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 05:43:54,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:54,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:43:54,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:54,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171494946] [2023-02-17 05:43:54,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171494946] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:43:54,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:43:54,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 05:43:54,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880306452] [2023-02-17 05:43:54,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:43:54,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:43:54,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:54,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:43:54,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:43:54,578 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:54,595 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2023-02-17 05:43:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 05:43:54,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2023-02-17 05:43:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:54,596 INFO L225 Difference]: With dead ends: 24 [2023-02-17 05:43:54,596 INFO L226 Difference]: Without dead ends: 17 [2023-02-17 05:43:54,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:43:54,597 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:54,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-17 05:43:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2023-02-17 05:43:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-02-17 05:43:54,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2023-02-17 05:43:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:54,601 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-02-17 05:43:54,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-02-17 05:43:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 05:43:54,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:54,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:54,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:54,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:54,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:54,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2023-02-17 05:43:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:54,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146741695] [2023-02-17 05:43:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:54,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:54,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:54,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 05:43:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:54,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:43:54,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:54,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:54,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146741695] [2023-02-17 05:43:54,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146741695] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:54,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:54,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-17 05:43:54,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730844599] [2023-02-17 05:43:54,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:54,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 05:43:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 05:43:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:43:54,868 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:54,906 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-02-17 05:43:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 05:43:54,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) Word has length 9 [2023-02-17 05:43:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:54,907 INFO L225 Difference]: With dead ends: 23 [2023-02-17 05:43:54,907 INFO L226 Difference]: Without dead ends: 19 [2023-02-17 05:43:54,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:43:54,908 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:54,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-17 05:43:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-17 05:43:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-02-17 05:43:54,912 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2023-02-17 05:43:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:54,912 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-02-17 05:43:54,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-02-17 05:43:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 05:43:54,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:54,913 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:54,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:55,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:55,122 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2023-02-17 05:43:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:55,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47002057] [2023-02-17 05:43:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:55,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:55,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:55,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:55,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 05:43:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:55,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 05:43:55,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 05:43:55,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 05:43:55,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:55,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47002057] [2023-02-17 05:43:55,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47002057] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:55,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:55,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-17 05:43:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695462149] [2023-02-17 05:43:55,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:55,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 05:43:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 05:43:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-17 05:43:55,247 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:55,416 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-02-17 05:43:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 05:43:55,417 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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) Word has length 18 [2023-02-17 05:43:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:55,418 INFO L225 Difference]: With dead ends: 56 [2023-02-17 05:43:55,418 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 05:43:55,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-02-17 05:43:55,419 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:55,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 52 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:43:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 05:43:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2023-02-17 05:43:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-17 05:43:55,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2023-02-17 05:43:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:55,431 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-17 05:43:55,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-17 05:43:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 05:43:55,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:55,433 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:55,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:55,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:55,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2023-02-17 05:43:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:55,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397145039] [2023-02-17 05:43:55,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 05:43:55,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:55,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:55,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 05:43:55,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 05:43:55,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:43:55,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 05:43:55,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:55,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:55,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:55,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397145039] [2023-02-17 05:43:55,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397145039] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:55,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:55,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-17 05:43:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987136395] [2023-02-17 05:43:55,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:55,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 05:43:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:55,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 05:43:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-17 05:43:55,760 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:55,836 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-02-17 05:43:55,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 05:43:55,837 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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) Word has length 18 [2023-02-17 05:43:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:55,837 INFO L225 Difference]: With dead ends: 35 [2023-02-17 05:43:55,837 INFO L226 Difference]: Without dead ends: 31 [2023-02-17 05:43:55,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-02-17 05:43:55,838 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:55,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 68 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-17 05:43:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-17 05:43:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-02-17 05:43:55,842 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2023-02-17 05:43:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:55,842 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-02-17 05:43:55,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-02-17 05:43:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 05:43:55,843 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:55,843 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:55,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-17 05:43:56,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:56,050 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2023-02-17 05:43:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:56,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924908835] [2023-02-17 05:43:56,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 05:43:56,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:56,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:56,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:56,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 05:43:56,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-17 05:43:56,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:43:56,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 05:43:56,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 05:43:56,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 05:43:57,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:57,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924908835] [2023-02-17 05:43:57,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924908835] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:57,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:57,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-02-17 05:43:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831829705] [2023-02-17 05:43:57,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:57,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-17 05:43:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-17 05:43:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2023-02-17 05:43:57,178 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:58,203 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-02-17 05:43:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-17 05:43:58,211 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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) Word has length 30 [2023-02-17 05:43:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:58,211 INFO L225 Difference]: With dead ends: 75 [2023-02-17 05:43:58,211 INFO L226 Difference]: Without dead ends: 71 [2023-02-17 05:43:58,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=379, Invalid=2171, Unknown=0, NotChecked=0, Total=2550 [2023-02-17 05:43:58,213 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:58,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 149 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 05:43:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-17 05:43:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2023-02-17 05:43:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-02-17 05:43:58,219 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2023-02-17 05:43:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:58,219 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-02-17 05:43:58,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-02-17 05:43:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 05:43:58,220 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:58,220 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:58,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:58,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:58,421 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2023-02-17 05:43:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:58,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213890864] [2023-02-17 05:43:58,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 05:43:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:58,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:58,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:58,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 05:43:58,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 05:43:58,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:43:58,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 05:43:58,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:58,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:58,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:58,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213890864] [2023-02-17 05:43:58,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213890864] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:58,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:58,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-17 05:43:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237961047] [2023-02-17 05:43:58,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:58,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 05:43:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:58,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 05:43:58,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-02-17 05:43:58,708 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:59,159 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2023-02-17 05:43:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 05:43:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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) Word has length 30 [2023-02-17 05:43:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:59,161 INFO L225 Difference]: With dead ends: 111 [2023-02-17 05:43:59,161 INFO L226 Difference]: Without dead ends: 87 [2023-02-17 05:43:59,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 05:43:59,162 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 200 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:59,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 64 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:43:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-17 05:43:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2023-02-17 05:43:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-02-17 05:43:59,171 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 30 [2023-02-17 05:43:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:59,171 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-02-17 05:43:59,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-02-17 05:43:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 05:43:59,172 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:59,172 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:59,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:59,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:59,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1430216517, now seen corresponding path program 5 times [2023-02-17 05:43:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:59,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524852628] [2023-02-17 05:43:59,374 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 05:43:59,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:59,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:59,375 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:59,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 05:43:59,399 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-02-17 05:43:59,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:43:59,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 05:43:59,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:59,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:43:59,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:59,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524852628] [2023-02-17 05:43:59,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524852628] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:43:59,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:43:59,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-02-17 05:43:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019011685] [2023-02-17 05:43:59,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:43:59,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 05:43:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 05:43:59,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2023-02-17 05:43:59,779 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:59,896 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-02-17 05:43:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 05:43:59,897 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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) Word has length 33 [2023-02-17 05:43:59,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:59,897 INFO L225 Difference]: With dead ends: 56 [2023-02-17 05:43:59,897 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 05:43:59,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2023-02-17 05:43:59,898 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:59,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:43:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 05:43:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 05:43:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 05:43:59,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-02-17 05:43:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:59,899 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 05:43:59,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 05:43:59,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 05:43:59,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 05:43:59,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 05:44:00,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:44:00,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 05:44:00,114 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 05:44:00,115 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 38) the Hoare annotation is: (let ((.cse75 ((_ extract 7 0) (bvadd (_ bv1 32) (_ bv0 32))))) (let ((.cse47 ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) .cse75))))) (let ((.cse81 ((_ zero_extend 24) .cse47))) (let ((.cse66 ((_ extract 7 0) (bvadd (_ bv1 32) .cse81)))) (let ((.cse68 ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) .cse66))))) (let ((.cse80 ((_ zero_extend 24) |ULTIMATE.start_main_~c~0#1|)) (.cse52 ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) .cse68))))) (let ((.cse40 ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) .cse52)))) (.cse78 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse80))))) (let ((.cse76 ((_ extract 7 0) (bvadd (_ bv0 32) (_ bv1 32)))) (.cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse81)))) (.cse13 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|)) (.cse60 ((_ zero_extend 24) |ULTIMATE.start_main_~y~0#1|)) (.cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse78)))) (.cse1 ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) .cse40))))) (let ((.cse5 (bvslt .cse80 (_ bv8 32))) (.cse15 ((_ extract 7 0) (bvand (_ bv37 32) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) ((_ zero_extend 24) .cse1))))))) (.cse32 (bvslt .cse78 (_ bv8 32))) (.cse51 (bvslt .cse79 (_ bv8 32))) (.cse67 (= .cse13 .cse60)) (.cse77 ((_ extract 7 0) (bvadd ((_ zero_extend 24) .cse76) .cse62)))) (let ((.cse3 ((_ zero_extend 24) .cse77)) (.cse31 ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse80)))))) (.cse30 ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse79)))))) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse79)))) (.cse58 (or (not .cse32) .cse51 .cse67)) (.cse2 (= |ULTIMATE.start_main_~bit~0#1| .cse15)) (.cse18 ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse78)))))) (.cse48 (= |ULTIMATE.start_main_~y~0#1| .cse77)) (.cse50 (or .cse32 .cse67)) (.cse41 (or .cse5 .cse67)) (.cse42 (= |ULTIMATE.start_main_~y~0#1| .cse76)) (.cse44 (not (= (_ bv0 32) ((_ zero_extend 24) |ULTIMATE.start_main_~bit~0#1|)))) (.cse0 (= |ULTIMATE.start_main_~x~0#1| (_ bv37 8)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| .cse1) .cse2 (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse4)))))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse4))))))))) .cse5 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse12))))) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse10))))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse11))))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse8))))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse6))))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse7))))) (and (bvslt .cse6 (_ bv8 32)) (bvslt .cse7 (_ bv8 32)) (bvslt .cse8 (_ bv8 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse9))) (bvslt .cse10 (_ bv8 32)) (bvslt .cse11 (_ bv8 32)) (bvslt .cse12 (_ bv8 32)) (bvslt .cse9 (_ bv8 32)))))))))))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse27))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse14))))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse17))))) (and (= ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse14))))) .cse15) .cse2 (= ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse16)))))))) .cse15) (= ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse16))))) .cse15) (= ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse17))))) .cse15) (= .cse18 .cse15) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse24))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse22))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse23))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse21))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse19))))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse20))))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse25))))) (and (bvslt .cse19 (_ bv8 32)) (bvslt .cse20 (_ bv8 32)) (bvslt .cse21 (_ bv8 32)) (bvslt .cse22 (_ bv8 32)) (bvslt .cse23 (_ bv8 32)) (bvslt .cse24 (_ bv8 32)) (bvslt .cse25 (_ bv8 32)) (bvslt .cse26 (_ bv8 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse26))))))))))))) (= ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse27))))) .cse15) (or (and .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse28)))))))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse28)))))) (bvslt .cse29 (_ bv8 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse29)))))))) .cse5) (= .cse30 .cse15) (= .cse31 .cse15))))) (and .cse0 .cse32 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse38 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse38))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse36))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse37))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse35))))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse34))))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse33))) (bvslt .cse34 (_ bv8 32)) (bvslt .cse33 (_ bv8 32)) (bvslt .cse35 (_ bv8 32)) (bvslt .cse36 (_ bv8 32)) (bvslt .cse37 (_ bv8 32)) (bvslt .cse38 (_ bv8 32)))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse39 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse39))) (= |ULTIMATE.start_main_~y~0#1| ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse39))))))))) (= |ULTIMATE.start_main_~c~0#1| .cse40) .cse5 .cse41) (let ((.cse43 (= |ULTIMATE.start_main_~c~0#1| .cse47))) (and .cse0 .cse2 .cse42 .cse43 (or (and .cse0 .cse32 .cse43 .cse5) (and .cse0 .cse32 .cse43 .cse5 .cse44)) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse46 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse46))))) (and (bvslt .cse45 (_ bv8 32)) (bvslt .cse46 (_ bv8 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse45))))))))) (and .cse0 .cse2 .cse32 .cse48 (let ((.cse49 (not (= (_ bv0 32) ((_ zero_extend 24) .cse31))))) (or .cse49 (and .cse49 .cse44))) .cse50 .cse5 .cse41 .cse51 (= |ULTIMATE.start_main_~c~0#1| .cse52) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse55 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse57))))) (let ((.cse56 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse55))))) (let ((.cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse56))))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse54))))) (and (bvslt .cse53 (_ bv8 32)) (bvslt .cse54 (_ bv8 32)) (bvslt .cse55 (_ bv8 32)) (bvslt .cse56 (_ bv8 32)) (bvslt .cse57 (_ bv8 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))))))))) (let ((.cse59 (not .cse51)) (.cse61 (bvslt .cse27 (_ bv8 32)))) (and .cse58 (or .cse59 (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse60 ((_ zero_extend 24) |ULTIMATE.start_main_~i~0#1|))))) .cse61) (= |ULTIMATE.start_main_~bit~0#1| ((_ extract 7 0) (bvand (_ bv37 32) .cse62))) .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse65 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse65))))) (let ((.cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse64))))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse63))) (bvslt .cse64 (_ bv8 32)) (bvslt .cse63 (_ bv8 32)) (bvslt .cse65 (_ bv8 32))))))) .cse48 (not (= (_ bv0 32) ((_ zero_extend 24) .cse30))) (= |ULTIMATE.start_main_~c~0#1| .cse66) .cse50 (or .cse59 .cse61 .cse67) .cse5 .cse41)) (and (= |ULTIMATE.start_main_~c~0#1| .cse68) .cse58 .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse72 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse70 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse72))))) (let ((.cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse70))))) (let ((.cse69 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse71))))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse69))) (bvslt .cse69 (_ bv8 32)) (bvslt .cse70 (_ bv8 32)) (bvslt .cse71 (_ bv8 32)) (bvslt .cse72 (_ bv8 32)))))))) .cse2 (let ((.cse73 (not (= (_ bv0 32) ((_ zero_extend 24) .cse18))))) (or .cse73 (and .cse73 .cse44))) .cse48 .cse50 .cse41) (and .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse74 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (and (bvslt .cse74 (_ bv8 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse74)))))) .cse42 (= |ULTIMATE.start_main_~c~0#1| .cse75) .cse44) (and .cse0 (= |ULTIMATE.start_main_~c~0#1| (_ bv0 8)) .cse5 (= |ULTIMATE.start_main_~y~0#1| (_ bv0 8)))))))))))))) [2023-02-17 05:44:00,116 INFO L899 garLoopResultBuilder]: For program point L31-3(lines 31 38) no Hoare annotation was computed. [2023-02-17 05:44:00,116 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-02-17 05:44:00,116 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2023-02-17 05:44:00,116 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 05:44:00,116 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 42) the Hoare annotation is: true [2023-02-17 05:44:00,116 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2023-02-17 05:44:00,116 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2023-02-17 05:44:00,116 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 05:44:00,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 05:44:00,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-02-17 05:44:00,116 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-02-17 05:44:00,118 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-02-17 05:44:00,119 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 05:44:00,132 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,137 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,139 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,139 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,139 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,139 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,139 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 05:44:00 BoogieIcfgContainer [2023-02-17 05:44:00,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 05:44:00,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 05:44:00,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 05:44:00,175 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 05:44:00,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:43:53" (3/4) ... [2023-02-17 05:44:00,182 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 05:44:00,188 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-17 05:44:00,188 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 05:44:00,189 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 05:44:00,189 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 05:44:00,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((x == 37bv8 && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0] && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32))) || ((((((((((~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0])) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ((x == 37bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: (y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0]))[7:0])) || ~bvslt32(~zero_extendFrom8To32(c), 8bv32))) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0])) || ((((((x == 37bv8 && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32))) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: c == ~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0] && y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0])) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (~bvslt32(~zero_extendFrom8To32(c), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y)))) || (((((x == 37bv8 && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && y == ~bvadd128(0bv32, 1bv32)[7:0]) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]) && ((((x == 37bv8 && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) || ((((x == 37bv8 && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && !(0bv32 == ~zero_extendFrom8To32(bit))))) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))) || ((((((((((x == 37bv8 && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32)) && y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]) && (!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0])) || (!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0])) && !(0bv32 == ~zero_extendFrom8To32(bit))))) && (~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (~bvslt32(~zero_extendFrom8To32(c), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))) || (((((((((((((!~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32)) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y)) && ((!~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(i))[7:0])) || ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]), 8bv32))) && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]) && x == 37bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32))) && y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]) && !(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]) && (~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && ((!~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32) || ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]), 8bv32)) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (~bvslt32(~zero_extendFrom8To32(c), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y)))) || ((((((((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0] && ((!~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32)) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && x == 37bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32))) && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && (!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0])) || (!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0])) && !(0bv32 == ~zero_extendFrom8To32(bit))))) && y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]) && (~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && (~bvslt32(~zero_extendFrom8To32(c), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y)))) || ((((x == 37bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0])) && y == ~bvadd128(0bv32, 1bv32)[7:0]) && c == ~bvadd128(1bv32, 0bv32)[7:0]) && !(0bv32 == ~zero_extendFrom8To32(bit)))) || (((x == 37bv8 && c == 0bv8) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && y == 0bv8) [2023-02-17 05:44:00,209 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 05:44:00,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 05:44:00,210 INFO L158 Benchmark]: Toolchain (without parser) took 6987.14ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 80.0MB in the beginning and 63.4MB in the end (delta: 16.7MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2023-02-17 05:44:00,210 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 57.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:44:00,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.49ms. Allocated memory is still 102.8MB. Free memory was 80.0MB in the beginning and 69.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 05:44:00,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.27ms. Allocated memory is still 102.8MB. Free memory was 69.2MB in the beginning and 67.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:44:00,211 INFO L158 Benchmark]: Boogie Preprocessor took 37.41ms. Allocated memory is still 102.8MB. Free memory was 67.7MB in the beginning and 66.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:44:00,211 INFO L158 Benchmark]: RCFGBuilder took 259.43ms. Allocated memory is still 102.8MB. Free memory was 66.4MB in the beginning and 57.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 05:44:00,212 INFO L158 Benchmark]: TraceAbstraction took 6440.86ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 56.7MB in the beginning and 65.4MB in the end (delta: -8.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-02-17 05:44:00,212 INFO L158 Benchmark]: Witness Printer took 34.78ms. Allocated memory is still 123.7MB. Free memory was 65.4MB in the beginning and 63.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:44:00,214 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.20ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 57.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.49ms. Allocated memory is still 102.8MB. Free memory was 80.0MB in the beginning and 69.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.27ms. Allocated memory is still 102.8MB. Free memory was 69.2MB in the beginning and 67.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.41ms. Allocated memory is still 102.8MB. Free memory was 67.7MB in the beginning and 66.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 259.43ms. Allocated memory is still 102.8MB. Free memory was 66.4MB in the beginning and 57.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6440.86ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 56.7MB in the beginning and 65.4MB in the end (delta: -8.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Witness Printer took 34.78ms. Allocated memory is still 123.7MB. Free memory was 65.4MB in the beginning and 63.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,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: 16]: 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 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 445 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 357 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 887 IncrementalHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 88 mSDtfsCounter, 887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 154 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 2181 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 159 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 250 ConstructedInterpolants, 46 QuantifiedInterpolants, 6099 SizeOfPredicates, 26 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 194/576 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: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant [2023-02-17 05:44:00,240 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,240 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,240 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,241 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,241 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,241 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,241 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,241 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,241 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,242 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,242 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,242 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,242 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,242 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,243 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,243 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,243 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,243 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,243 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,243 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,251 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,251 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-17 05:44:00,257 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,257 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,257 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,257 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,257 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,257 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,258 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,258 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,258 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,258 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,258 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,258 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,258 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,259 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,259 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,259 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,259 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,259 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,259 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-17 05:44:00,260 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] Derived loop invariant: ((((((((((((x == 37bv8 && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0] && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32))) || ((((((((((~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0])) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ((x == 37bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: (y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0]))[7:0])) || ~bvslt32(~zero_extendFrom8To32(c), 8bv32))) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0] == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0])) || ((((((x == 37bv8 && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32))) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: c == ~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0] && y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]))[7:0])) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (~bvslt32(~zero_extendFrom8To32(c), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y)))) || (((((x == 37bv8 && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && y == ~bvadd128(0bv32, 1bv32)[7:0]) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]) && ((((x == 37bv8 && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) || ((((x == 37bv8 && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && !(0bv32 == ~zero_extendFrom8To32(bit))))) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))) || ((((((((((x == 37bv8 && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32)) && y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]) && (!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0])) || (!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0])) && !(0bv32 == ~zero_extendFrom8To32(bit))))) && (~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (~bvslt32(~zero_extendFrom8To32(c), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32)) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))) || (((((((((((((!~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32)) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y)) && ((!~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(i))[7:0])) || ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]), 8bv32))) && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]) && x == 37bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32))) && y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]) && !(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]))[7:0]))) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]) && (~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && ((!~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32) || ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0]), 8bv32)) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (~bvslt32(~zero_extendFrom8To32(c), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y)))) || ((((((((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0] && ((!~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]), 8bv32)) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && x == 37bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32))) && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) && (!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0])) || (!(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0]))[7:0])) && !(0bv32 == ~zero_extendFrom8To32(bit))))) && y == ~bvadd128(~zero_extendFrom8To32(~bvadd128(0bv32, 1bv32)[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(1bv32, 0bv32)[7:0]))[7:0]))[7:0]))[7:0]) && (~bvslt32(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(c))[7:0]), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y))) && (~bvslt32(~zero_extendFrom8To32(c), 8bv32) || ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(y)))) || ((((x == 37bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58), 8bv32) && c == ~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0])) && y == ~bvadd128(0bv32, 1bv32)[7:0]) && c == ~bvadd128(1bv32, 0bv32)[7:0]) && !(0bv32 == ~zero_extendFrom8To32(bit)))) || (((x == 37bv8 && c == 0bv8) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && y == 0bv8) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-17 05:44:00,276 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