./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invariants/bin-suffix-5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/loop-invariants/bin-suffix-5.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 5914c4745abcb0dcb313c2b575f4f16975b523b456d4ed119a355a5c133e341f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:09:17,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:09:17,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:09:17,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:09:17,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:09:17,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:09:17,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:09:17,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:09:17,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:09:17,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:09:17,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:09:17,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:09:17,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:09:17,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:09:17,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:09:17,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:09:17,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:09:17,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:09:17,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:09:17,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:09:17,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:09:17,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:09:17,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:09:17,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:09:17,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:09:17,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:09:17,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:09:17,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:09:17,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:09:17,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:09:17,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:09:17,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:09:17,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:09:17,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:09:17,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:09:17,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:09:17,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:09:17,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:09:17,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:09:17,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:09:17,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:09:17,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:09:17,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:09:17,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:09:17,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:09:17,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:09:17,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:09:17,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:09:17,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:09:17,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:09:17,246 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:09:17,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:09:17,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:09:17,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:09:17,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:09:17,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:09:17,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:09:17,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:09:17,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:09:17,248 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:09:17,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:09:17,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:09:17,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:09:17,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:09:17,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:09:17,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:09:17,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:09:17,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:09:17,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:09:17,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:09:17,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:09:17,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:09:17,250 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:09:17,251 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:09:17,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:09:17,251 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 -> 5914c4745abcb0dcb313c2b575f4f16975b523b456d4ed119a355a5c133e341f [2022-02-20 17:09:17,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:09:17,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:09:17,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:09:17,475 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:09:17,475 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:09:17,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invariants/bin-suffix-5.c [2022-02-20 17:09:17,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed3c4406/f2f7729b48f6426c98b43fa9cf98c356/FLAGb6054001b [2022-02-20 17:09:17,864 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:09:17,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invariants/bin-suffix-5.c [2022-02-20 17:09:17,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed3c4406/f2f7729b48f6426c98b43fa9cf98c356/FLAGb6054001b [2022-02-20 17:09:17,901 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed3c4406/f2f7729b48f6426c98b43fa9cf98c356 [2022-02-20 17:09:17,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:09:17,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:09:17,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:09:17,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:09:17,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:09:17,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:09:17" (1/1) ... [2022-02-20 17:09:17,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fbe027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:17, skipping insertion in model container [2022-02-20 17:09:17,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:09:17" (1/1) ... [2022-02-20 17:09:17,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:09:17,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:09:18,036 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/loop-invariants/bin-suffix-5.c[359,372] [2022-02-20 17:09:18,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:09:18,050 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:09:18,058 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/loop-invariants/bin-suffix-5.c[359,372] [2022-02-20 17:09:18,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:09:18,070 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:09:18,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18 WrapperNode [2022-02-20 17:09:18,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:09:18,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:09:18,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:09:18,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:09:18,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,090 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2022-02-20 17:09:18,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:09:18,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:09:18,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:09:18,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:09:18,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:09:18,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:09:18,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:09:18,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:09:18,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (1/1) ... [2022-02-20 17:09:18,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:09:18,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:18,126 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) [2022-02-20 17:09:18,145 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 [2022-02-20 17:09:18,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:09:18,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:09:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:09:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:09:18,200 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:09:18,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:09:18,322 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:09:18,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:09:18,327 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:09:18,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:18 BoogieIcfgContainer [2022-02-20 17:09:18,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:09:18,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:09:18,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:09:18,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:09:18,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:09:17" (1/3) ... [2022-02-20 17:09:18,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1e177c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:09:18, skipping insertion in model container [2022-02-20 17:09:18,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:18" (2/3) ... [2022-02-20 17:09:18,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1e177c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:09:18, skipping insertion in model container [2022-02-20 17:09:18,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:18" (3/3) ... [2022-02-20 17:09:18,334 INFO L111 eAbstractionObserver]: Analyzing ICFG bin-suffix-5.c [2022-02-20 17:09:18,338 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:09:18,338 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:09:18,366 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:09:18,374 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 [2022-02-20 17:09:18,375 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:09:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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) [2022-02-20 17:09:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:09:18,391 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:18,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:09:18,392 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash 889783783, now seen corresponding path program 1 times [2022-02-20 17:09:18,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:18,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986493785] [2022-02-20 17:09:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:18,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:18,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {15#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15#true} is VALID [2022-02-20 17:09:18,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {15#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~x~0#1;main_~x~0#1 := 5; {15#true} is VALID [2022-02-20 17:09:18,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {15#true} assume !true; {16#false} is VALID [2022-02-20 17:09:18,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {16#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 5 == (if 0 == main_~x~0#1 then 0 else (if 1 == main_~x~0#1 then 1 else ~bitwiseAnd(main_~x~0#1, 5))) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {16#false} is VALID [2022-02-20 17:09:18,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond#1; {16#false} is VALID [2022-02-20 17:09:18,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2022-02-20 17:09:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:18,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:18,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986493785] [2022-02-20 17:09:18,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986493785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:18,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:18,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:09:18,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840658432] [2022-02-20 17:09:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:18,556 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 [2022-02-20 17:09:18,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:18,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:09:18,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:18,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:09:18,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:09:18,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:09:18,616 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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) 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) [2022-02-20 17:09:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:18,641 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 17:09:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:09:18,641 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 [2022-02-20 17:09:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:09:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2022-02-20 17:09:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:09:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2022-02-20 17:09:18,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 22 transitions. [2022-02-20 17:09:18,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:18,699 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:09:18,699 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 17:09:18,701 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 [2022-02-20 17:09:18,705 INFO L933 BasicCegarLoop]: 12 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, 12 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 [2022-02-20 17:09:18,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 17:09:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 17:09:18,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:18,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 17:09:18,725 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 17:09:18,726 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 17:09:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:18,727 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:09:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:09:18,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:18,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:18,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 17:09:18,729 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 17:09:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:18,731 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:09:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:09:18,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:18,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:18,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:18,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 17:09:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 17:09:18,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-02-20 17:09:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:18,737 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 17:09:18,737 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) [2022-02-20 17:09:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:09:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:09:18,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:18,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:18,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:09:18,740 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:18,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1806847180, now seen corresponding path program 1 times [2022-02-20 17:09:18,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:18,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801437118] [2022-02-20 17:09:18,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:18,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:09:18,783 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:09:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:09:18,823 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:09:18,823 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:09:18,825 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:09:18,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:09:18,829 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 17:09:18,831 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:09:18,868 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:09:18,869 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:09:18,869 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2022-02-20 17:09:18,873 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2022-02-20 17:09:18,873 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2022-02-20 17:09:18,873 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 17:09:18,873 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 17:09:18,873 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:09:18,873 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:09:18,873 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:09:18,874 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:09:18,874 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-02-20 17:09:18,874 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 17:09:18,874 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:09:18,874 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:09:18,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:09:18 BoogieIcfgContainer [2022-02-20 17:09:18,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:09:18,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:09:18,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:09:18,877 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:09:18,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:18" (3/4) ... [2022-02-20 17:09:18,880 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 17:09:18,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:09:18,882 INFO L158 Benchmark]: Toolchain (without parser) took 976.16ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 60.5MB in the beginning and 97.7MB in the end (delta: -37.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:18,882 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:18,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.73ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 74.8MB in the end (delta: -14.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:09:18,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.45ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 73.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:09:18,886 INFO L158 Benchmark]: Boogie Preprocessor took 12.81ms. Allocated memory is still 100.7MB. Free memory was 73.2MB in the beginning and 72.4MB in the end (delta: 842.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:18,888 INFO L158 Benchmark]: RCFGBuilder took 223.37ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 63.3MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:09:18,888 INFO L158 Benchmark]: TraceAbstraction took 545.90ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 62.7MB in the beginning and 97.9MB in the end (delta: -35.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:18,888 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 121.6MB. Free memory was 97.9MB in the beginning and 97.7MB in the end (delta: 234.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:18,893 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.73ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 74.8MB in the end (delta: -14.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.45ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 73.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.81ms. Allocated memory is still 100.7MB. Free memory was 73.2MB in the beginning and 72.4MB in the end (delta: 842.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 223.37ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 63.3MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 545.90ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 62.7MB in the beginning and 97.9MB in the end (delta: -35.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 121.6MB. Free memory was 97.9MB in the beginning and 97.7MB in the end (delta: 234.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 16. Possible FailurePath: [L12] unsigned int x = 5; VAL [x=5] [L13] COND FALSE !(__VERIFIER_nondet_int()) [L16] CALL __VERIFIER_assert((x & 5) == 5) [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 12 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 [2022-02-20 17:09:18,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/loop-invariants/bin-suffix-5.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 5914c4745abcb0dcb313c2b575f4f16975b523b456d4ed119a355a5c133e341f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:09:20,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:09:20,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:09:20,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:09:20,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:09:20,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:09:20,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:09:20,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:09:20,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:09:20,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:09:20,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:09:20,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:09:20,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:09:20,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:09:20,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:09:20,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:09:20,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:09:20,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:09:20,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:09:20,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:09:20,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:09:20,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:09:20,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:09:20,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:09:20,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:09:20,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:09:20,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:09:20,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:09:20,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:09:20,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:09:20,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:09:20,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:09:20,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:09:20,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:09:20,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:09:20,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:09:20,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:09:20,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:09:20,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:09:20,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:09:20,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:09:20,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:09:20,780 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:09:20,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:09:20,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:09:20,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:09:20,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:09:20,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:09:20,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:09:20,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:09:20,784 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:09:20,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:09:20,784 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:09:20,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:09:20,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:09:20,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:09:20,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:09:20,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:09:20,785 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:09:20,785 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:09:20,786 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:09:20,786 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:09:20,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:09:20,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:09:20,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:09:20,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:09:20,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:09:20,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:09:20,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:09:20,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:09:20,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:09:20,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:09:20,792 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:09:20,792 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:09:20,792 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:09:20,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:09:20,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:09:20,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:09:20,793 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 -> 5914c4745abcb0dcb313c2b575f4f16975b523b456d4ed119a355a5c133e341f [2022-02-20 17:09:21,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:09:21,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:09:21,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:09:21,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:09:21,070 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:09:21,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invariants/bin-suffix-5.c [2022-02-20 17:09:21,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5121ae146/59cf0df9bfe849268c1fd1711376d17b/FLAG3a35e0813 [2022-02-20 17:09:21,484 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:09:21,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invariants/bin-suffix-5.c [2022-02-20 17:09:21,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5121ae146/59cf0df9bfe849268c1fd1711376d17b/FLAG3a35e0813 [2022-02-20 17:09:21,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5121ae146/59cf0df9bfe849268c1fd1711376d17b [2022-02-20 17:09:21,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:09:21,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:09:21,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:09:21,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:09:21,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:09:21,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:09:21" (1/1) ... [2022-02-20 17:09:21,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abadfad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:21, skipping insertion in model container [2022-02-20 17:09:21,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:09:21" (1/1) ... [2022-02-20 17:09:21,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:09:21,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:09:22,040 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/loop-invariants/bin-suffix-5.c[359,372] [2022-02-20 17:09:22,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:09:22,057 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:09:22,065 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/loop-invariants/bin-suffix-5.c[359,372] [2022-02-20 17:09:22,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:09:22,118 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:09:22,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22 WrapperNode [2022-02-20 17:09:22,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:09:22,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:09:22,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:09:22,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:09:22,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,144 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2022-02-20 17:09:22,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:09:22,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:09:22,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:09:22,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:09:22,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:09:22,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:09:22,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:09:22,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:09:22,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (1/1) ... [2022-02-20 17:09:22,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:09:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:22,213 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) [2022-02-20 17:09:22,235 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 [2022-02-20 17:09:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:09:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:09:22,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:09:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:09:22,302 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:09:22,304 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:09:22,411 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:09:22,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:09:22,421 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:09:22,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:22 BoogieIcfgContainer [2022-02-20 17:09:22,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:09:22,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:09:22,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:09:22,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:09:22,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:09:21" (1/3) ... [2022-02-20 17:09:22,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac20195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:09:22, skipping insertion in model container [2022-02-20 17:09:22,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:22" (2/3) ... [2022-02-20 17:09:22,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac20195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:09:22, skipping insertion in model container [2022-02-20 17:09:22,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:22" (3/3) ... [2022-02-20 17:09:22,428 INFO L111 eAbstractionObserver]: Analyzing ICFG bin-suffix-5.c [2022-02-20 17:09:22,432 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:09:22,432 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:09:22,476 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:09:22,483 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 [2022-02-20 17:09:22,484 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:09:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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) [2022-02-20 17:09:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:09:22,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:22,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:09:22,506 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:22,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-02-20 17:09:22,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:09:22,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789885008] [2022-02-20 17:09:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:22,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:09:22,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:09:22,527 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) [2022-02-20 17:09:22,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:09:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:22,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:09:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:22,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:22,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {14#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {14#true} is VALID [2022-02-20 17:09:22,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {14#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~x~0#1;main_~x~0#1 := 5bv32; {22#(= |ULTIMATE.start_main_~x~0#1| (_ bv5 32))} is VALID [2022-02-20 17:09:22,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#(= |ULTIMATE.start_main_~x~0#1| (_ bv5 32))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {22#(= |ULTIMATE.start_main_~x~0#1| (_ bv5 32))} is VALID [2022-02-20 17:09:22,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#(= |ULTIMATE.start_main_~x~0#1| (_ bv5 32))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 5bv32 == ~bvand32(5bv32, main_~x~0#1) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {29#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 17:09:22,726 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {15#false} is VALID [2022-02-20 17:09:22,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {15#false} assume !false; {15#false} is VALID [2022-02-20 17:09:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:22,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:09:22,727 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:09:22,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789885008] [2022-02-20 17:09:22,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789885008] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:22,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:22,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:09:22,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604315352] [2022-02-20 17:09:22,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:22,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 [2022-02-20 17:09:22,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:22,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 17:09:22,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:22,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:09:22,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:09:22,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:09:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:09:22,772 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 17:09:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:22,853 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:09:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:09:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 [2022-02-20 17:09:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 17:09:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:09:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 17:09:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:09:22,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-02-20 17:09:22,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:22,902 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:09:22,903 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 17:09:22,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:09:22,907 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:22,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 17:09:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 17:09:22,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:22,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 17:09:22,925 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 17:09:22,926 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 17:09:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:22,927 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:09:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:09:22,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:22,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:22,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 17:09:22,928 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 17:09:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:22,928 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:09:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:09:22,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:22,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:22,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:22,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2022-02-20 17:09:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 17:09:22,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-02-20 17:09:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:22,931 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 17:09:22,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-02-20 17:09:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:09:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:09:22,932 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:22,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:22,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:23,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:09:23,139 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-02-20 17:09:23,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:09:23,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042743771] [2022-02-20 17:09:23,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:23,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:09:23,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:09:23,142 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) [2022-02-20 17:09:23,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:09:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:23,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:09:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:23,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:23,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {97#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {97#true} is VALID [2022-02-20 17:09:23,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {97#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~x~0#1;main_~x~0#1 := 5bv32; {105#(= |ULTIMATE.start_main_~x~0#1| (_ bv5 32))} is VALID [2022-02-20 17:09:23,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#(= |ULTIMATE.start_main_~x~0#1| (_ bv5 32))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~x~0#1 := ~bvadd32(8bv32, main_~x~0#1); {109#(= (_ bv5 32) (bvadd |ULTIMATE.start_main_~x~0#1| (_ bv4294967288 32)))} is VALID [2022-02-20 17:09:23,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#(= (_ bv5 32) (bvadd |ULTIMATE.start_main_~x~0#1| (_ bv4294967288 32)))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {109#(= (_ bv5 32) (bvadd |ULTIMATE.start_main_~x~0#1| (_ bv4294967288 32)))} is VALID [2022-02-20 17:09:23,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {109#(= (_ bv5 32) (bvadd |ULTIMATE.start_main_~x~0#1| (_ bv4294967288 32)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 5bv32 == ~bvand32(5bv32, main_~x~0#1) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {116#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 17:09:23,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {116#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {98#false} is VALID [2022-02-20 17:09:23,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#false} assume !false; {98#false} is VALID [2022-02-20 17:09:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:23,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:23,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#false} assume !false; {98#false} is VALID [2022-02-20 17:09:23,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond#1; {98#false} is VALID [2022-02-20 17:09:23,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {130#(= (bvand |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (_ bv5 32))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 5bv32 == ~bvand32(5bv32, main_~x~0#1) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {126#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))} is VALID [2022-02-20 17:09:23,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {130#(= (bvand |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (_ bv5 32))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {130#(= (bvand |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (_ bv5 32))} is VALID [2022-02-20 17:09:23,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {130#(= (bvand |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (_ bv5 32))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~x~0#1 := ~bvadd32(8bv32, main_~x~0#1); {130#(= (bvand |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (_ bv5 32))} is VALID [2022-02-20 17:09:23,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {97#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~x~0#1;main_~x~0#1 := 5bv32; {130#(= (bvand |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (_ bv5 32))} is VALID [2022-02-20 17:09:23,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {97#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {97#true} is VALID [2022-02-20 17:09:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:09:23,346 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:09:23,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042743771] [2022-02-20 17:09:23,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042743771] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:23,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:09:23,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-02-20 17:09:23,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634551102] [2022-02-20 17:09:23,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-02-20 17:09:23,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:23,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-20 17:09:23,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:23,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:09:23,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:09:23,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:09:23,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:09:23,356 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-20 17:09:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:23,375 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:09:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:09:23,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-02-20 17:09:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-20 17:09:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-02-20 17:09:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-20 17:09:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-02-20 17:09:23,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 7 transitions. [2022-02-20 17:09:23,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:23,383 INFO L225 Difference]: With dead ends: 8 [2022-02-20 17:09:23,384 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:09:23,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:09:23,385 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:23,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:09:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:09:23,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:23,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-02-20 17:09:23,386 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-02-20 17:09:23,387 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-02-20 17:09:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:23,387 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:09:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:09:23,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:23,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:23,387 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 17:09:23,388 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 17:09:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:23,388 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:09:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:09:23,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:23,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:23,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:23,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:23,389 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) [2022-02-20 17:09:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:09:23,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2022-02-20 17:09:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:23,389 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:09:23,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-20 17:09:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:09:23,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:23,391 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:09:23,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 17:09:23,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:09:23,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:09:23,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:09:23,612 INFO L861 garLoopResultBuilder]: At program point L17(lines 11 18) the Hoare annotation is: true [2022-02-20 17:09:23,613 INFO L854 garLoopResultBuilder]: At program point L13-2(lines 13 15) the Hoare annotation is: (= (bvand |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (_ bv5 32)) [2022-02-20 17:09:23,613 INFO L858 garLoopResultBuilder]: For program point L13-3(lines 13 15) no Hoare annotation was computed. [2022-02-20 17:09:23,613 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-20 17:09:23,613 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:09:23,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:09:23,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:09:23,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-02-20 17:09:23,613 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-02-20 17:09:23,613 INFO L861 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-02-20 17:09:23,616 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 17:09:23,617 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:09:23,619 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:09:23,620 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:09:23,620 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2022-02-20 17:09:23,620 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2022-02-20 17:09:23,623 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2022-02-20 17:09:23,623 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:09:23,623 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:09:23,623 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:09:23,623 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:09:23,623 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:09:23,624 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:09:23,624 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:09:23,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:09:23 BoogieIcfgContainer [2022-02-20 17:09:23,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:09:23,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:09:23,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:09:23,629 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:09:23,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:22" (3/4) ... [2022-02-20 17:09:23,631 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:09:23,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 17:09:23,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:09:23,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:09:23,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:09:23,669 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:09:23,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:09:23,670 INFO L158 Benchmark]: Toolchain (without parser) took 1747.61ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 41.3MB in the beginning and 40.6MB in the end (delta: 695.7kB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-02-20 17:09:23,670 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.8MB in the end (delta: 52.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:23,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.03ms. Allocated memory is still 60.8MB. Free memory was 41.2MB in the beginning and 44.8MB in the end (delta: -3.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:09:23,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.97ms. Allocated memory is still 60.8MB. Free memory was 44.6MB in the beginning and 43.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:23,676 INFO L158 Benchmark]: Boogie Preprocessor took 24.93ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 42.2MB in the end (delta: 902.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:23,676 INFO L158 Benchmark]: RCFGBuilder took 250.27ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 33.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:09:23,676 INFO L158 Benchmark]: TraceAbstraction took 1205.60ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 33.4MB in the beginning and 42.8MB in the end (delta: -9.3MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-02-20 17:09:23,676 INFO L158 Benchmark]: Witness Printer took 40.04ms. Allocated memory is still 73.4MB. Free memory was 42.8MB in the beginning and 40.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:09:23,678 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.8MB in the end (delta: 52.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.03ms. Allocated memory is still 60.8MB. Free memory was 41.2MB in the beginning and 44.8MB in the end (delta: -3.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.97ms. Allocated memory is still 60.8MB. Free memory was 44.6MB in the beginning and 43.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.93ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 42.2MB in the end (delta: 902.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 250.27ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 33.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1205.60ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 33.4MB in the beginning and 42.8MB in the end (delta: -9.3MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Witness Printer took 40.04ms. Allocated memory is still 73.4MB. Free memory was 42.8MB in the beginning and 40.6MB in the end (delta: 2.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 - PositiveResult [Line: 7]: 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, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 11 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 8 NumberOfFragments, 7 HoareAnnotationTreeSize, 3 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 50 SizeOfPredicates, 4 NumberOfNonLiveVariables, 42 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1/2 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: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ~bvand32(x, 5bv32) == 5bv32 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:09:23,704 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