./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:41:53,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:41:53,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:41:53,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:41:53,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:41:53,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:41:53,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:41:53,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:41:53,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:41:53,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:41:53,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:41:53,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:41:53,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:41:53,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:41:53,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:41:53,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:41:53,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:41:53,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:41:53,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:41:53,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:41:53,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:41:53,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:41:53,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:41:53,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:41:53,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:41:53,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:41:53,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:41:53,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:41:53,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:41:53,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:41:53,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:41:53,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:41:53,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:41:53,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:41:53,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:41:53,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:41:53,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:41:53,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:41:53,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:41:53,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:41:53,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:41:53,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:41:53,796 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:41:53,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:41:53,797 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:41:53,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:41:53,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:41:53,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:41:53,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:41:53,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:41:53,799 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:41:53,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:41:53,799 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:41:53,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:41:53,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:41:53,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:41:53,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:41:53,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:41:53,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:41:53,800 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:41:53,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:41:53,801 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:41:53,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:41:53,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:41:53,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:41:53,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:41:53,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:41:53,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:41:53,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:41:53,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:41:53,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:41:53,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:41:53,803 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:41:53,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:41:53,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:41:53,804 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:41:53,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2021-12-14 11:41:53,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:41:54,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:41:54,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:41:54,034 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:41:54,037 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:41:54,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 [2021-12-14 11:41:54,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b06d9ab9/659f098c94074735bdc7105e0004dfe4/FLAG6af11b0e1 [2021-12-14 11:41:54,427 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:41:54,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2021-12-14 11:41:54,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b06d9ab9/659f098c94074735bdc7105e0004dfe4/FLAG6af11b0e1 [2021-12-14 11:41:54,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b06d9ab9/659f098c94074735bdc7105e0004dfe4 [2021-12-14 11:41:54,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:41:54,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:41:54,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:41:54,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:41:54,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:41:54,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:41:54" (1/1) ... [2021-12-14 11:41:54,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d48b61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:54, skipping insertion in model container [2021-12-14 11:41:54,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:41:54" (1/1) ... [2021-12-14 11:41:54,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:41:54,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:41:54,984 WARN L230 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] [2021-12-14 11:41:54,993 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:41:54,998 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:41:55,005 WARN L230 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] [2021-12-14 11:41:55,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:41:55,019 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:41:55,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55 WrapperNode [2021-12-14 11:41:55,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:41:55,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:41:55,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:41:55,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:41:55,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,047 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2021-12-14 11:41:55,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:41:55,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:41:55,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:41:55,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:41:55,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:41:55,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:41:55,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:41:55,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:41:55,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (1/1) ... [2021-12-14 11:41:55,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:41:55,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:41:55,088 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) [2021-12-14 11:41:55,108 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 [2021-12-14 11:41:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:41:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:41:55,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:41:55,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:41:55,187 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:41:55,188 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:41:55,267 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:41:55,272 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:41:55,272 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 11:41:55,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:41:55 BoogieIcfgContainer [2021-12-14 11:41:55,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:41:55,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:41:55,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:41:55,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:41:55,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:41:54" (1/3) ... [2021-12-14 11:41:55,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dfa87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:41:55, skipping insertion in model container [2021-12-14 11:41:55,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:55" (2/3) ... [2021-12-14 11:41:55,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dfa87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:41:55, skipping insertion in model container [2021-12-14 11:41:55,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:41:55" (3/3) ... [2021-12-14 11:41:55,280 INFO L111 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2021-12-14 11:41:55,284 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:41:55,285 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:41:55,362 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:41:55,381 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 11:41:55,381 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:41:55,391 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) [2021-12-14 11:41:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 11:41:55,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:55,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 11:41:55,403 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:55,409 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2021-12-14 11:41:55,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:41:55,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103991112] [2021-12-14 11:41:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:55,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:41:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:55,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:41:55,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103991112] [2021-12-14 11:41:55,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103991112] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:55,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:55,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:41:55,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980415275] [2021-12-14 11:41:55,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:55,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:41:55,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:41:55,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:41:55,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:41:55,544 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) [2021-12-14 11:41:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:55,553 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-12-14 11:41:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:41:55,555 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 [2021-12-14 11:41:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:55,560 INFO L225 Difference]: With dead ends: 21 [2021-12-14 11:41:55,560 INFO L226 Difference]: Without dead ends: 9 [2021-12-14 11:41:55,563 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:41:55,566 INFO L933 BasicCegarLoop]: 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 [2021-12-14 11:41:55,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:41:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-12-14 11:41:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-14 11:41:55,587 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) [2021-12-14 11:41:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-12-14 11:41:55,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2021-12-14 11:41:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:55,589 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-14 11:41:55,589 INFO L471 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) [2021-12-14 11:41:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2021-12-14 11:41:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 11:41:55,590 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:55,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 11:41:55,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:41:55,591 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:55,596 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2021-12-14 11:41:55,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:41:55,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775884860] [2021-12-14 11:41:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:55,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:41:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:55,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:41:55,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775884860] [2021-12-14 11:41:55,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775884860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:55,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:55,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:41:55,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904546516] [2021-12-14 11:41:55,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:55,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:41:55,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:41:55,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:41:55,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:41:55,672 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) [2021-12-14 11:41:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:55,685 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2021-12-14 11:41:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:41:55,685 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 [2021-12-14 11:41:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:55,686 INFO L225 Difference]: With dead ends: 16 [2021-12-14 11:41:55,686 INFO L226 Difference]: Without dead ends: 12 [2021-12-14 11:41:55,686 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:41:55,688 INFO L933 BasicCegarLoop]: 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 [2021-12-14 11:41:55,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:41:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-14 11:41:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2021-12-14 11:41:55,693 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) [2021-12-14 11:41:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-12-14 11:41:55,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2021-12-14 11:41:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:55,694 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-14 11:41:55,694 INFO L471 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) [2021-12-14 11:41:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-12-14 11:41:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 11:41:55,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:55,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:55,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:41:55,698 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:55,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:55,699 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2021-12-14 11:41:55,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:41:55,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124672672] [2021-12-14 11:41:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:55,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:41:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:55,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:41:55,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124672672] [2021-12-14 11:41:55,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124672672] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:41:55,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352693798] [2021-12-14 11:41:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:55,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:41:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:41:55,779 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) [2021-12-14 11:41:55,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 11:41:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:55,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:41:55,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:55,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:55,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352693798] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:55,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:41:55,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 8 [2021-12-14 11:41:55,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75228258] [2021-12-14 11:41:55,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:55,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:41:55,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:41:55,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:41:55,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:41:55,900 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) [2021-12-14 11:41:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:55,946 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2021-12-14 11:41:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:41:55,947 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 [2021-12-14 11:41:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:55,948 INFO L225 Difference]: With dead ends: 23 [2021-12-14 11:41:55,948 INFO L226 Difference]: Without dead ends: 19 [2021-12-14 11:41:55,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:41:55,949 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:55,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:41:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-14 11:41:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-14 11:41:55,952 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) [2021-12-14 11:41:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-14 11:41:55,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2021-12-14 11:41:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:55,953 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-14 11:41:55,953 INFO L471 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) [2021-12-14 11:41:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-12-14 11:41:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 11:41:55,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:55,954 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:55,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:56,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:41:56,172 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:56,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2021-12-14 11:41:56,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:41:56,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534000357] [2021-12-14 11:41:56,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:56,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:41:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:56,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:41:56,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534000357] [2021-12-14 11:41:56,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534000357] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:41:56,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468806259] [2021-12-14 11:41:56,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:41:56,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:41:56,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:41:56,266 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) [2021-12-14 11:41:56,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 11:41:56,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:41:56,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:41:56,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 11:41:56,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:56,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:56,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468806259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:56,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:41:56,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2021-12-14 11:41:56,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184338069] [2021-12-14 11:41:56,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:56,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:41:56,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:41:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:41:56,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:41:56,625 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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) [2021-12-14 11:41:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:57,019 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2021-12-14 11:41:57,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 11:41:57,020 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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 [2021-12-14 11:41:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:57,020 INFO L225 Difference]: With dead ends: 41 [2021-12-14 11:41:57,020 INFO L226 Difference]: Without dead ends: 37 [2021-12-14 11:41:57,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2021-12-14 11:41:57,022 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:57,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 96 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-14 11:41:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-14 11:41:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 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) [2021-12-14 11:41:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2021-12-14 11:41:57,026 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 18 [2021-12-14 11:41:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:57,026 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2021-12-14 11:41:57,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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) [2021-12-14 11:41:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2021-12-14 11:41:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:41:57,027 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:57,027 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:57,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:57,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-14 11:41:57,246 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 3 times [2021-12-14 11:41:57,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:41:57,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841275574] [2021-12-14 11:41:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:57,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:41:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 11:41:57,264 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 11:41:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 11:41:57,318 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 11:41:57,319 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 11:41:57,319 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:41:57,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 11:41:57,323 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2021-12-14 11:41:57,325 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 11:41:57,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:41:57 BoogieIcfgContainer [2021-12-14 11:41:57,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 11:41:57,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 11:41:57,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 11:41:57,344 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 11:41:57,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:41:55" (3/4) ... [2021-12-14 11:41:57,347 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 11:41:57,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 11:41:57,347 INFO L158 Benchmark]: Toolchain (without parser) took 2488.98ms. Allocated memory is still 134.2MB. Free memory was 98.9MB in the beginning and 78.8MB in the end (delta: 20.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2021-12-14 11:41:57,347 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory was 107.7MB in the beginning and 107.7MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:41:57,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.51ms. Allocated memory is still 134.2MB. Free memory was 98.7MB in the beginning and 110.0MB in the end (delta: -11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 11:41:57,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.26ms. Allocated memory is still 134.2MB. Free memory was 110.0MB in the beginning and 108.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:41:57,348 INFO L158 Benchmark]: Boogie Preprocessor took 14.22ms. Allocated memory is still 134.2MB. Free memory was 108.0MB in the beginning and 107.4MB in the end (delta: 634.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:41:57,348 INFO L158 Benchmark]: RCFGBuilder took 210.89ms. Allocated memory is still 134.2MB. Free memory was 107.4MB in the beginning and 98.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 11:41:57,349 INFO L158 Benchmark]: TraceAbstraction took 2069.02ms. Allocated memory is still 134.2MB. Free memory was 97.5MB in the beginning and 80.0MB in the end (delta: 17.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2021-12-14 11:41:57,349 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 134.2MB. Free memory was 80.0MB in the beginning and 78.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:41:57,350 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory was 107.7MB in the beginning and 107.7MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.51ms. Allocated memory is still 134.2MB. Free memory was 98.7MB in the beginning and 110.0MB in the end (delta: -11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.26ms. Allocated memory is still 134.2MB. Free memory was 110.0MB in the beginning and 108.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.22ms. Allocated memory is still 134.2MB. Free memory was 108.0MB in the beginning and 107.4MB in the end (delta: 634.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 210.89ms. Allocated memory is still 134.2MB. Free memory was 107.4MB in the beginning and 98.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2069.02ms. Allocated memory is still 134.2MB. Free memory was 97.5MB in the beginning and 80.0MB in the end (delta: 17.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 134.2MB. Free memory was 80.0MB in the beginning and 78.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 [c=0, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=0, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=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 [c=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=2, 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 [c=2, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=2, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=3, 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 [c=3, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=3, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=4, 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 [c=4, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=4, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=5, 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 [c=5, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=5, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=6, 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 [c=6, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=6, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=7, 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 [c=7, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=7, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=8, x=37, y=0] [L31] COND FALSE !(c < (unsigned char)8) VAL [bit=0, c=8, 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: 2.0s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 47 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, InterpolantAutomatonStates: 26, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 595 SizeOfPredicates, 4 NumberOfNonLiveVariables, 103 ConjunctsInSsa, 23 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 [2021-12-14 11:41:57,407 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 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:41:59,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:41:59,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:41:59,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:41:59,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:41:59,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:41:59,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:41:59,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:41:59,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:41:59,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:41:59,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:41:59,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:41:59,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:41:59,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:41:59,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:41:59,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:41:59,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:41:59,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:41:59,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:41:59,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:41:59,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:41:59,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:41:59,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:41:59,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:41:59,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:41:59,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:41:59,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:41:59,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:41:59,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:41:59,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:41:59,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:41:59,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:41:59,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:41:59,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:41:59,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:41:59,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:41:59,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:41:59,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:41:59,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:41:59,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:41:59,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:41:59,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-14 11:41:59,367 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:41:59,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:41:59,369 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:41:59,369 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:41:59,370 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:41:59,370 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:41:59,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:41:59,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:41:59,371 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:41:59,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:41:59,372 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:41:59,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:41:59,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:41:59,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:41:59,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:41:59,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:41:59,373 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 11:41:59,373 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 11:41:59,373 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 11:41:59,373 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:41:59,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:41:59,382 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:41:59,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:41:59,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:41:59,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:41:59,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:41:59,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:41:59,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:41:59,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:41:59,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:41:59,383 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 11:41:59,383 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 11:41:59,384 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:41:59,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:41:59,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:41:59,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:41:59,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 11:41:59,385 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 [2021-12-14 11:41:59,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:41:59,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:41:59,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:41:59,659 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:41:59,659 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:41:59,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2021-12-14 11:41:59,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1aa5dda/0e174247bf0144848614a04dc8874f33/FLAGb676e7c29 [2021-12-14 11:42:00,011 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:42:00,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2021-12-14 11:42:00,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1aa5dda/0e174247bf0144848614a04dc8874f33/FLAGb676e7c29 [2021-12-14 11:42:00,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1aa5dda/0e174247bf0144848614a04dc8874f33 [2021-12-14 11:42:00,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:42:00,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:42:00,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:42:00,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:42:00,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:42:00,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66af9ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00, skipping insertion in model container [2021-12-14 11:42:00,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:42:00,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:42:00,652 WARN L230 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] [2021-12-14 11:42:00,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:42:00,702 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:42:00,720 WARN L230 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] [2021-12-14 11:42:00,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:42:00,732 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:42:00,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00 WrapperNode [2021-12-14 11:42:00,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:42:00,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:42:00,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:42:00,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:42:00,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,750 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2021-12-14 11:42:00,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:42:00,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:42:00,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:42:00,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:42:00,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:42:00,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:42:00,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:42:00,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:42:00,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (1/1) ... [2021-12-14 11:42:00,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:42:00,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:42:00,832 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) [2021-12-14 11:42:00,841 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 [2021-12-14 11:42:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:42:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:42:00,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:42:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 11:42:00,912 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:42:00,914 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:42:01,018 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:42:01,021 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:42:01,031 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 11:42:01,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:42:01 BoogieIcfgContainer [2021-12-14 11:42:01,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:42:01,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:42:01,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:42:01,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:42:01,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:42:00" (1/3) ... [2021-12-14 11:42:01,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1e87bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:42:01, skipping insertion in model container [2021-12-14 11:42:01,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:00" (2/3) ... [2021-12-14 11:42:01,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1e87bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:42:01, skipping insertion in model container [2021-12-14 11:42:01,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:42:01" (3/3) ... [2021-12-14 11:42:01,037 INFO L111 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2021-12-14 11:42:01,040 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:42:01,040 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:42:01,110 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:42:01,118 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 11:42:01,118 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:42:01,136 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) [2021-12-14 11:42:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 11:42:01,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:42:01,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 11:42:01,143 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:42:01,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:42:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2021-12-14 11:42:01,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:42:01,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593189163] [2021-12-14 11:42:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:42:01,157 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:42:01,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:42:01,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:42:01,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 11:42:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:42:01,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 11:42:01,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:42:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:01,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:42:01,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:42:01,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593189163] [2021-12-14 11:42:01,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593189163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:42:01,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:42:01,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:42:01,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887597997] [2021-12-14 11:42:01,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:42:01,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:42:01,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:42:01,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:42:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:42:01,321 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) [2021-12-14 11:42:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:42:01,329 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-12-14 11:42:01,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:42:01,330 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 [2021-12-14 11:42:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:42:01,334 INFO L225 Difference]: With dead ends: 21 [2021-12-14 11:42:01,335 INFO L226 Difference]: Without dead ends: 9 [2021-12-14 11:42:01,336 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:42:01,338 INFO L933 BasicCegarLoop]: 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 [2021-12-14 11:42:01,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:42:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-12-14 11:42:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-14 11:42:01,365 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) [2021-12-14 11:42:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-12-14 11:42:01,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2021-12-14 11:42:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:42:01,366 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-14 11:42:01,366 INFO L471 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) [2021-12-14 11:42:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2021-12-14 11:42:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 11:42:01,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:42:01,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 11:42:01,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 11:42:01,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:42:01,573 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:42:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:42:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2021-12-14 11:42:01,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:42:01,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358323542] [2021-12-14 11:42:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:42:01,574 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:42:01,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:42:01,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:42:01,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 11:42:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:42:01,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 11:42:01,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:42:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:01,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:42:01,649 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:42:01,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358323542] [2021-12-14 11:42:01,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358323542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:42:01,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:42:01,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:42:01,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626930230] [2021-12-14 11:42:01,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:42:01,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:42:01,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:42:01,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:42:01,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:42:01,652 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) [2021-12-14 11:42:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:42:01,659 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2021-12-14 11:42:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:42:01,660 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 [2021-12-14 11:42:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:42:01,660 INFO L225 Difference]: With dead ends: 16 [2021-12-14 11:42:01,660 INFO L226 Difference]: Without dead ends: 12 [2021-12-14 11:42:01,661 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:42:01,662 INFO L933 BasicCegarLoop]: 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 [2021-12-14 11:42:01,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:42:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-14 11:42:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2021-12-14 11:42:01,664 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) [2021-12-14 11:42:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-12-14 11:42:01,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2021-12-14 11:42:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:42:01,665 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-14 11:42:01,665 INFO L471 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) [2021-12-14 11:42:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-12-14 11:42:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 11:42:01,666 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:42:01,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:42:01,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-14 11:42:01,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:42:01,872 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:42:01,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:42:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2021-12-14 11:42:01,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:42:01,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128619511] [2021-12-14 11:42:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:42:01,873 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:42:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:42:01,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:42:01,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 11:42:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:42:01,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:42:01,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:42:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:01,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:42:01,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:42:01,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128619511] [2021-12-14 11:42:01,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128619511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:42:01,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:42:01,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:42:01,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965912386] [2021-12-14 11:42:01,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:42:01,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:42:01,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:42:01,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:42:01,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:42:01,938 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) [2021-12-14 11:42:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:42:01,956 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-12-14 11:42:01,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:42:01,956 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 [2021-12-14 11:42:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:42:01,957 INFO L225 Difference]: With dead ends: 24 [2021-12-14 11:42:01,957 INFO L226 Difference]: Without dead ends: 17 [2021-12-14 11:42:01,957 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:42:01,958 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:42:01,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:42:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-14 11:42:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2021-12-14 11:42:01,960 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) [2021-12-14 11:42:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-12-14 11:42:01,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2021-12-14 11:42:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:42:01,961 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-14 11:42:01,961 INFO L471 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) [2021-12-14 11:42:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2021-12-14 11:42:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 11:42:01,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:42:01,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:42:02,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:42:02,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:42:02,168 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:42:02,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:42:02,168 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2021-12-14 11:42:02,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:42:02,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556568746] [2021-12-14 11:42:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:42:02,169 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:42:02,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:42:02,170 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:42:02,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 11:42:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:42:02,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:42:02,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:42:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:02,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:42:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:02,235 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:42:02,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556568746] [2021-12-14 11:42:02,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556568746] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:42:02,236 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:42:02,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-14 11:42:02,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647370988] [2021-12-14 11:42:02,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:42:02,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:42:02,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:42:02,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:42:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:42:02,237 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) [2021-12-14 11:42:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:42:02,259 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-12-14 11:42:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:42:02,260 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 [2021-12-14 11:42:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:42:02,260 INFO L225 Difference]: With dead ends: 23 [2021-12-14 11:42:02,260 INFO L226 Difference]: Without dead ends: 19 [2021-12-14 11:42:02,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:42:02,261 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 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 [2021-12-14 11:42:02,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:42:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-14 11:42:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-14 11:42:02,264 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) [2021-12-14 11:42:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2021-12-14 11:42:02,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2021-12-14 11:42:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:42:02,265 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-12-14 11:42:02,265 INFO L471 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) [2021-12-14 11:42:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2021-12-14 11:42:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 11:42:02,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:42:02,274 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:42:02,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-14 11:42:02,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:42:02,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:42:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:42:02,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2021-12-14 11:42:02,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:42:02,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766934918] [2021-12-14 11:42:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:42:02,476 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:42:02,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:42:02,481 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:42:02,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 11:42:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:42:02,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 11:42:02,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:42:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 11:42:02,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:42:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 11:42:02,649 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:42:02,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766934918] [2021-12-14 11:42:02,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766934918] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:42:02,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:42:02,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-14 11:42:02,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598972549] [2021-12-14 11:42:02,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:42:02,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:42:02,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:42:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:42:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:42:02,651 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) [2021-12-14 11:42:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:42:02,792 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2021-12-14 11:42:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:42:02,793 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 [2021-12-14 11:42:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:42:02,794 INFO L225 Difference]: With dead ends: 56 [2021-12-14 11:42:02,794 INFO L226 Difference]: Without dead ends: 47 [2021-12-14 11:42:02,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-14 11:42:02,795 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:42:02,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 52 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:42:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-14 11:42:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2021-12-14 11:42:02,799 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) [2021-12-14 11:42:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-12-14 11:42:02,799 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2021-12-14 11:42:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:42:02,799 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-14 11:42:02,800 INFO L471 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) [2021-12-14 11:42:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2021-12-14 11:42:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 11:42:02,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:42:02,800 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-14 11:42:02,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-14 11:42:03,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:42:03,006 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:42:03,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:42:03,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2021-12-14 11:42:03,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:42:03,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119441794] [2021-12-14 11:42:03,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:42:03,008 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:42:03,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:42:03,008 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:42:03,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 11:42:03,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:42:03,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:42:03,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:42:03,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:42:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:03,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:42:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:03,146 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:42:03,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119441794] [2021-12-14 11:42:03,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119441794] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:42:03,146 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:42:03,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-14 11:42:03,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589757050] [2021-12-14 11:42:03,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:42:03,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 11:42:03,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:42:03,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 11:42:03,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:42:03,148 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) [2021-12-14 11:42:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:42:03,206 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2021-12-14 11:42:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:42:03,207 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 [2021-12-14 11:42:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:42:03,207 INFO L225 Difference]: With dead ends: 35 [2021-12-14 11:42:03,207 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 11:42:03,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:42:03,208 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:42:03,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 68 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:42:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 11:42:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-14 11:42:03,211 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) [2021-12-14 11:42:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-12-14 11:42:03,212 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2021-12-14 11:42:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:42:03,212 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-12-14 11:42:03,212 INFO L471 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) [2021-12-14 11:42:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-12-14 11:42:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:42:03,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:42:03,213 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2021-12-14 11:42:03,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-14 11:42:03,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:42:03,420 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:42:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:42:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2021-12-14 11:42:03,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:42:03,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521505928] [2021-12-14 11:42:03,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:42:03,421 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:42:03,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:42:03,422 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:42:03,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 11:42:03,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-12-14 11:42:03,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:42:03,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 11:42:03,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:42:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 11:42:03,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:42:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 11:42:04,822 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:42:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521505928] [2021-12-14 11:42:04,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521505928] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:42:04,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:42:04,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-12-14 11:42:04,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067047575] [2021-12-14 11:42:04,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:42:04,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-14 11:42:04,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:42:04,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-14 11:42:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2021-12-14 11:42:04,825 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) [2021-12-14 11:42:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:42:05,152 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2021-12-14 11:42:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 11:42:05,153 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 [2021-12-14 11:42:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:42:05,153 INFO L225 Difference]: With dead ends: 64 [2021-12-14 11:42:05,154 INFO L226 Difference]: Without dead ends: 60 [2021-12-14 11:42:05,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2021-12-14 11:42:05,155 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:42:05,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 142 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 233 Unchecked, 0.0s Time] [2021-12-14 11:42:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-14 11:42:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2021-12-14 11:42:05,159 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) [2021-12-14 11:42:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2021-12-14 11:42:05,160 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2021-12-14 11:42:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:42:05,160 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2021-12-14 11:42:05,160 INFO L471 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) [2021-12-14 11:42:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2021-12-14 11:42:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:42:05,161 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:42:05,161 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-14 11:42:05,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 11:42:05,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:42:05,368 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:42:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:42:05,369 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2021-12-14 11:42:05,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:42:05,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392578812] [2021-12-14 11:42:05,369 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 11:42:05,369 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:42:05,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:42:05,370 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:42:05,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 11:42:05,394 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 11:42:05,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:42:05,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 11:42:05,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:42:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:05,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:42:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:05,820 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:42:05,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392578812] [2021-12-14 11:42:05,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392578812] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:42:05,820 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:42:05,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-14 11:42:05,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226134658] [2021-12-14 11:42:05,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:42:05,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 11:42:05,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:42:05,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 11:42:05,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-12-14 11:42:05,822 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) [2021-12-14 11:42:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:42:06,375 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2021-12-14 11:42:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-14 11:42:06,375 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 [2021-12-14 11:42:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:42:06,376 INFO L225 Difference]: With dead ends: 111 [2021-12-14 11:42:06,376 INFO L226 Difference]: Without dead ends: 87 [2021-12-14 11:42:06,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-12-14 11:42:06,378 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 209 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:42:06,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 64 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:42:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-14 11:42:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2021-12-14 11:42:06,384 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) [2021-12-14 11:42:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2021-12-14 11:42:06,385 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 30 [2021-12-14 11:42:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:42:06,385 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2021-12-14 11:42:06,385 INFO L471 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) [2021-12-14 11:42:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2021-12-14 11:42:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 11:42:06,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:42:06,386 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1] [2021-12-14 11:42:06,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-14 11:42:06,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:42:06,595 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:42:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:42:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1430216517, now seen corresponding path program 5 times [2021-12-14 11:42:06,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:42:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463650598] [2021-12-14 11:42:06,596 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 11:42:06,596 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:42:06,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:42:06,597 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:42:06,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 11:42:06,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-12-14 11:42:06,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:42:06,623 WARN L261 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-14 11:42:06,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:42:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 37 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:08,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:42:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:42:10,528 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:42:10,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463650598] [2021-12-14 11:42:10,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463650598] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:42:10,528 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:42:10,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2021-12-14 11:42:10,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888103596] [2021-12-14 11:42:10,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:42:10,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-14 11:42:10,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:42:10,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-14 11:42:10,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1624, Unknown=0, NotChecked=0, Total=2070 [2021-12-14 11:42:10,530 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 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) [2021-12-14 11:42:11,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:42:11,875 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2021-12-14 11:42:11,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 11:42:11,876 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 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) Word has length 33 [2021-12-14 11:42:11,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:42:11,876 INFO L225 Difference]: With dead ends: 56 [2021-12-14 11:42:11,876 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 11:42:11,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=855, Invalid=3435, Unknown=0, NotChecked=0, Total=4290 [2021-12-14 11:42:11,878 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:42:11,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 13 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2021-12-14 11:42:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 11:42:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 11:42:11,879 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) [2021-12-14 11:42:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 11:42:11,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2021-12-14 11:42:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:42:11,879 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 11:42:11,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 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) [2021-12-14 11:42:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 11:42:11,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 11:42:11,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:42:11,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-14 11:42:12,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:42:12,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 11:42:12,595 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 11:42:12,595 INFO L854 garLoopResultBuilder]: At program point L31-2(lines 31 38) the Hoare annotation is: (let ((.cse9 (= (_ bv1 8) |ULTIMATE.start_main_~y~0#1|)) (.cse2 (= |ULTIMATE.start_main_~y~0#1| (_ bv5 8))) (.cse8 (= |ULTIMATE.start_main_~bit~0#1| (_ bv0 8))) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (_ bv37 8)))) (or (and (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse0 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse0))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse0 (_ bv1 32))))))) (= (_ bv6 8) |ULTIMATE.start_main_~c~0#1|) .cse1) (and .cse2 (= (_ bv4 8) |ULTIMATE.start_main_~bit~0#1|) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse3 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse3))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse3)))))) (_ bv0 32)))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse6))))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (_ bv1 32))))) (.cse5 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))) (bvslt .cse4 (_ bv8 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse6)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse7)))))))))))) .cse1) (and .cse8 (= |ULTIMATE.start_main_~c~0#1| (_ bv2 8)) .cse1 .cse9) (and .cse8 (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse10))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 (_ bv1 32)))) (_ bv1 32))))))) .cse1 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse15))))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse12))))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 (_ bv1 32)))))))) (.cse11 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse12)))))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse13)))))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse13 (_ bv1 32)))) (bvslt .cse13 (_ bv8 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse14)))))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse16))))))))))))))) (and (= (_ bv1 8) |ULTIMATE.start_main_~c~0#1|) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~bit~0#1|) (_ bv0 32))) .cse1 .cse9) (and .cse2 .cse8 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse20))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|)) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse18))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse18)))))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse19 (_ bv1 32)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse19)))))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse20)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse21))))))) (bvslt .cse19 (_ bv8 32)))))))) .cse1) (and (= |ULTIMATE.start_main_~y~0#1| (_ bv0 8)) (= |ULTIMATE.start_main_~c~0#1| (_ bv0 8)) .cse1) (and .cse2 .cse8 (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 ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|)) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse24))))) (and (bvslt .cse22 (_ bv8 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse24)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse22))))))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse22 (_ bv1 32)))))))) .cse1 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |ULTIMATE.start_main_~c~0#1|) (_ bv1 32)))))))))) (_ bv0 32)))) (and .cse8 (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse25))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))) (bvslt .cse26 (_ bv8 32)))))) .cse1 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8)) (|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse32 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse32))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse33 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse28))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 (_ bv1 32))))))))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 (_ bv1 32))))) (.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse28)))))) (_ bv0 32)) (bvslt .cse29 (_ bv8 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse29 (_ bv1 32)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse30)))))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse29)))))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse31)))))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse32)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse33)))))))))))))))))) [2021-12-14 11:42:12,596 INFO L858 garLoopResultBuilder]: For program point L31-3(lines 31 38) no Hoare annotation was computed. [2021-12-14 11:42:12,596 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2021-12-14 11:42:12,596 INFO L861 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2021-12-14 11:42:12,596 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2021-12-14 11:42:12,596 INFO L858 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2021-12-14 11:42:12,596 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 11:42:12,597 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 11:42:12,598 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 11:42:12,598 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-12-14 11:42:12,598 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-12-14 11:42:12,598 INFO L861 garLoopResultBuilder]: At program point L41(lines 22 42) the Hoare annotation is: true [2021-12-14 11:42:12,601 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2021-12-14 11:42:12,603 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 11:42:12,614 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,615 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,616 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,616 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,616 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,616 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,623 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,623 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,623 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,623 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,625 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,625 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,625 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,625 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,626 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,626 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,626 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,626 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,627 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,641 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,641 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,641 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,641 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:42:12 BoogieIcfgContainer [2021-12-14 11:42:12,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 11:42:12,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 11:42:12,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 11:42:12,651 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 11:42:12,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:42:01" (3/4) ... [2021-12-14 11:42:12,655 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 11:42:12,660 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-12-14 11:42:12,660 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-14 11:42:12,660 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 11:42:12,660 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 11:42:12,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]) && 6bv8 == c) && x == 37bv8) || ((((y == 5bv8 && 4bv8 == bit) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: c == ~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0] && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32))) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 8bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))) && x == 37bv8)) || (((bit == 0bv8 && c == 2bv8) && x == 37bv8) && 1bv8 == y)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0])) && x == 37bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0])))) || (((1bv8 == c && !(~zero_extendFrom8To32(bit) == 0bv32)) && x == 37bv8) && 1bv8 == y)) || (((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 8bv32))) && x == 37bv8)) || ((y == 0bv8 && c == 0bv8) && x == 37bv8)) || ((((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0])) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0])) && x == 37bv8) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32))) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8, ULTIMATE.start_main_~x~0#1 : bv8 :: ((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))) [2021-12-14 11:42:12,679 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 11:42:12,679 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 11:42:12,679 INFO L158 Benchmark]: Toolchain (without parser) took 12213.83ms. Allocated memory was 71.3MB in the beginning and 172.0MB in the end (delta: 100.7MB). Free memory was 53.5MB in the beginning and 116.3MB in the end (delta: -62.8MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2021-12-14 11:42:12,680 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 71.3MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:42:12,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.52ms. Allocated memory is still 71.3MB. Free memory was 53.3MB in the beginning and 43.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 11:42:12,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.39ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 41.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:42:12,680 INFO L158 Benchmark]: Boogie Preprocessor took 47.08ms. Allocated memory is still 71.3MB. Free memory was 41.8MB in the beginning and 54.1MB in the end (delta: -12.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:42:12,680 INFO L158 Benchmark]: RCFGBuilder took 234.69ms. Allocated memory is still 71.3MB. Free memory was 53.8MB in the beginning and 45.8MB in the end (delta: 8.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-14 11:42:12,681 INFO L158 Benchmark]: TraceAbstraction took 11616.19ms. Allocated memory was 71.3MB in the beginning and 172.0MB in the end (delta: 100.7MB). Free memory was 45.2MB in the beginning and 118.4MB in the end (delta: -73.2MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2021-12-14 11:42:12,681 INFO L158 Benchmark]: Witness Printer took 28.57ms. Allocated memory is still 172.0MB. Free memory was 118.4MB in the beginning and 116.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:42:12,682 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.32ms. Allocated memory is still 71.3MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.52ms. Allocated memory is still 71.3MB. Free memory was 53.3MB in the beginning and 43.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.39ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 41.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.08ms. Allocated memory is still 71.3MB. Free memory was 41.8MB in the beginning and 54.1MB in the end (delta: -12.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 234.69ms. Allocated memory is still 71.3MB. Free memory was 53.8MB in the beginning and 45.8MB in the end (delta: 8.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11616.19ms. Allocated memory was 71.3MB in the beginning and 172.0MB in the end (delta: 100.7MB). Free memory was 45.2MB in the beginning and 118.4MB in the end (delta: -73.2MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. * Witness Printer took 28.57ms. Allocated memory is still 172.0MB. Free memory was 118.4MB in the beginning and 116.3MB 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_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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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_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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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[ULTIMATE.start_main_~x~0#1,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: 11.5s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 417 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 272 IncrementalHoareTripleChecker+Unchecked, 337 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 470 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 80 mSDtfsCounter, 470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, InterpolantAutomatonStates: 118, 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, 9 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 874 HoareAnnotationTreeSize, 3 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1029 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 159 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 282 ConstructedInterpolants, 46 QuantifiedInterpolants, 7387 SizeOfPredicates, 40 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 182/693 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 [2021-12-14 11:42:12,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,700 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,700 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,700 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,700 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,700 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,700 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2021-12-14 11:42:12,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2021-12-14 11:42:12,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] Derived loop invariant: ((((((((((\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]) && 6bv8 == c) && x == 37bv8) || ((((y == 5bv8 && 4bv8 == bit) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: c == ~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0] && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32))) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0] && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 8bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))) && x == 37bv8)) || (((bit == 0bv8 && c == 2bv8) && x == 37bv8) && 1bv8 == y)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0])) && x == 37bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0])))) || (((1bv8 == c && !(~zero_extendFrom8To32(bit) == 0bv32)) && x == 37bv8) && 1bv8 == y)) || (((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 8bv32))) && x == 37bv8)) || ((y == 0bv8 && c == 0bv8) && x == 37bv8)) || ((((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 8bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0])) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0])) && x == 37bv8) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32))) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8, ULTIMATE.start_main_~x~0#1 : bv8 :: ((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]))[7:0]))) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-14 11:42:12,769 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