./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invariants/linear-inequality-inv-b.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/linear-inequality-inv-b.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 752da8674c09ab2aa763dfc92e2ae3d757cf5403d673d6c22b243cb3c0d91c44 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:09:33,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:09:33,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:09:33,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:09:33,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:09:33,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:09:33,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:09:33,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:09:33,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:09:33,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:09:33,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:09:33,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:09:33,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:09:33,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:09:33,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:09:33,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:09:33,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:09:33,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:09:33,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:09:33,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:09:33,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:09:33,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:09:33,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:09:33,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:09:33,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:09:33,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:09:33,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:09:33,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:09:33,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:09:33,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:09:33,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:09:33,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:09:33,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:09:33,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:09:33,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:09:33,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:09:33,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:09:33,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:09:33,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:09:33,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:09:33,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:09:33,426 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:33,459 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:09:33,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:09:33,460 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:09:33,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:09:33,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:09:33,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:09:33,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:09:33,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:09:33,463 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:09:33,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:09:33,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:09:33,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:09:33,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:09:33,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:09:33,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:09:33,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:09:33,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:09:33,465 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:09:33,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:09:33,465 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:09:33,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:09:33,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:09:33,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:09:33,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:09:33,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:09:33,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:09:33,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:09:33,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:09:33,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:09:33,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:09:33,469 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:09:33,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:09:33,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:09:33,470 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 -> 752da8674c09ab2aa763dfc92e2ae3d757cf5403d673d6c22b243cb3c0d91c44 [2022-02-20 17:09:33,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:09:33,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:09:33,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:09:33,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:09:33,708 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:09:33,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invariants/linear-inequality-inv-b.c [2022-02-20 17:09:33,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67260edca/a4d7c37c6b0040c68e95588080cb1e6c/FLAG7efca8766 [2022-02-20 17:09:34,128 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:09:34,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invariants/linear-inequality-inv-b.c [2022-02-20 17:09:34,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67260edca/a4d7c37c6b0040c68e95588080cb1e6c/FLAG7efca8766 [2022-02-20 17:09:34,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67260edca/a4d7c37c6b0040c68e95588080cb1e6c [2022-02-20 17:09:34,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:09:34,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:09:34,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:09:34,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:09:34,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:09:34,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b1005d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34, skipping insertion in model container [2022-02-20 17:09:34,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:09:34,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:09:34,731 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/linear-inequality-inv-b.c[557,570] [2022-02-20 17:09:34,735 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/linear-inequality-inv-b.c[613,626] [2022-02-20 17:09:34,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:09:34,757 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:09:34,780 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/linear-inequality-inv-b.c[557,570] [2022-02-20 17:09:34,782 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/linear-inequality-inv-b.c[613,626] [2022-02-20 17:09:34,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:09:34,797 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:09:34,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34 WrapperNode [2022-02-20 17:09:34,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:09:34,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:09:34,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:09:34,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:09:34,807 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:34" (1/1) ... [2022-02-20 17:09:34,812 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:34" (1/1) ... [2022-02-20 17:09:34,839 INFO L137 Inliner]: procedures = 11, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:09:34,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:09:34,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:09:34,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:09:34,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:09:34,848 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:34" (1/1) ... [2022-02-20 17:09:34,848 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:34" (1/1) ... [2022-02-20 17:09:34,850 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:34" (1/1) ... [2022-02-20 17:09:34,851 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:34" (1/1) ... [2022-02-20 17:09:34,856 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:34" (1/1) ... [2022-02-20 17:09:34,862 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:34" (1/1) ... [2022-02-20 17:09:34,863 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:34" (1/1) ... [2022-02-20 17:09:34,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:09:34,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:09:34,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:09:34,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:09:34,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:09:34,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:34,906 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:34,908 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:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:09:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:09:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:09:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:09:34,986 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:09:34,987 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:09:35,089 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:09:35,093 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:09:35,094 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:09:35,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:35 BoogieIcfgContainer [2022-02-20 17:09:35,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:09:35,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:09:35,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:09:35,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:09:35,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:09:34" (1/3) ... [2022-02-20 17:09:35,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b1e578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:09:35, skipping insertion in model container [2022-02-20 17:09:35,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (2/3) ... [2022-02-20 17:09:35,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b1e578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:09:35, skipping insertion in model container [2022-02-20 17:09:35,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:35" (3/3) ... [2022-02-20 17:09:35,109 INFO L111 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-b.c [2022-02-20 17:09:35,114 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:09:35,114 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 17:09:35,182 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:09:35,190 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:35,190 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 17:09:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 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:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:09:35,208 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:35,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:09:35,210 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash 889577263, now seen corresponding path program 1 times [2022-02-20 17:09:35,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:35,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206054804] [2022-02-20 17:09:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:35,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:35,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {16#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(26, 2);call #Ultimate.allocInit(12, 3); {16#true} is VALID [2022-02-20 17:09:35,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {16#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {16#true} is VALID [2022-02-20 17:09:35,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {16#true} is VALID [2022-02-20 17:09:35,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {16#true} assume !true; {17#false} is VALID [2022-02-20 17:09:35,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {17#false} assume main_~s~0#1 % 256 < main_~v~0#1 % 256; {17#false} is VALID [2022-02-20 17:09:35,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {17#false} assume !false; {17#false} is VALID [2022-02-20 17:09:35,413 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:35,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:35,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206054804] [2022-02-20 17:09:35,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206054804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:35,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:35,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:09:35,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993354667] [2022-02-20 17:09:35,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:35,424 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:35,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:35,429 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:35,439 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:35,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:09:35,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:09:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:09:35,465 INFO L87 Difference]: Start difference. First operand has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 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:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:35,504 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-02-20 17:09:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:09:35,505 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:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:35,506 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:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2022-02-20 17:09:35,514 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:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2022-02-20 17:09:35,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 25 transitions. [2022-02-20 17:09:35,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:35,568 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:09:35,571 INFO L226 Difference]: Without dead ends: 7 [2022-02-20 17:09:35,577 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:35,583 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:35,596 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:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-02-20 17:09:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-02-20 17:09:35,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:35,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:35,620 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:35,620 INFO L87 Difference]: Start difference. First operand 7 states. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:35,622 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2022-02-20 17:09:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-20 17:09:35,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:35,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:35,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) Second operand 7 states. [2022-02-20 17:09:35,623 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) Second operand 7 states. [2022-02-20 17:09:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:35,624 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2022-02-20 17:09:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-20 17:09:35,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:35,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:35,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:35,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-02-20 17:09:35,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2022-02-20 17:09:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:35,628 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-02-20 17:09:35,628 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:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-20 17:09:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:09:35,628 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:35,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:09:35,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:09:35,629 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:35,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 889573419, now seen corresponding path program 1 times [2022-02-20 17:09:35,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:35,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274279044] [2022-02-20 17:09:35,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:35,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:35,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {65#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(26, 2);call #Ultimate.allocInit(12, 3); {65#true} is VALID [2022-02-20 17:09:35,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {65#true} is VALID [2022-02-20 17:09:35,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {65#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {67#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= |ULTIMATE.start_main_~n~0#1| (* 256 (div |ULTIMATE.start_main_~n~0#1| 256)))))} is VALID [2022-02-20 17:09:35,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= |ULTIMATE.start_main_~n~0#1| (* 256 (div |ULTIMATE.start_main_~n~0#1| 256)))))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {66#false} is VALID [2022-02-20 17:09:35,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {66#false} assume main_~s~0#1 % 256 < main_~v~0#1 % 256; {66#false} is VALID [2022-02-20 17:09:35,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {66#false} assume !false; {66#false} is VALID [2022-02-20 17:09:35,707 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:35,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:35,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274279044] [2022-02-20 17:09:35,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274279044] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:35,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:35,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:09:35,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766677553] [2022-02-20 17:09:35,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:35,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 17:09:35,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:35,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,717 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:35,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:09:35,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:35,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:09:35,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:09:35,719 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:35,738 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 17:09:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:09:35,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 17:09:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-20 17:09:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-20 17:09:35,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-20 17:09:35,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:35,753 INFO L225 Difference]: With dead ends: 11 [2022-02-20 17:09:35,753 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 17:09:35,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:09:35,755 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:35,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 17:09:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 17:09:35,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:35,760 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:35,760 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:35,760 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:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:35,761 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:09:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:09:35,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:35,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:35,762 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:35,763 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:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:35,763 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:09:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:09:35,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:35,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:35,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:35,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:35,765 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:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 17:09:35,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-02-20 17:09:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:35,766 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 17:09:35,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:09:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:09:35,767 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:35,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:35,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:09:35,767 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1807024099, now seen corresponding path program 1 times [2022-02-20 17:09:35,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:35,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2808126] [2022-02-20 17:09:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:35,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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(26, 2);call #Ultimate.allocInit(12, 3); {109#true} is VALID [2022-02-20 17:09:35,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {109#true} is VALID [2022-02-20 17:09:35,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {111#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:35,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {111#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 % 256 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {112#(<= (+ |ULTIMATE.start_main_~v~0#1| (* (div |ULTIMATE.start_main_~s~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:35,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {112#(<= (+ |ULTIMATE.start_main_~v~0#1| (* (div |ULTIMATE.start_main_~s~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {112#(<= (+ |ULTIMATE.start_main_~v~0#1| (* (div |ULTIMATE.start_main_~s~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:35,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {112#(<= (+ |ULTIMATE.start_main_~v~0#1| (* (div |ULTIMATE.start_main_~s~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|))} assume main_~s~0#1 % 256 < main_~v~0#1 % 256; {110#false} is VALID [2022-02-20 17:09:35,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 17:09:35,869 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:35,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:35,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2808126] [2022-02-20 17:09:35,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2808126] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:35,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809962925] [2022-02-20 17:09:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:35,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:35,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:35,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:35,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:09:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:35,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:09:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:35,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:35,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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(26, 2);call #Ultimate.allocInit(12, 3); {109#true} is VALID [2022-02-20 17:09:35,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {109#true} is VALID [2022-02-20 17:09:35,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {111#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:35,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {111#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 % 256 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {125#(= |ULTIMATE.start_main_~s~0#1| (mod |ULTIMATE.start_main_~v~0#1| 256))} is VALID [2022-02-20 17:09:35,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {125#(= |ULTIMATE.start_main_~s~0#1| (mod |ULTIMATE.start_main_~v~0#1| 256))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {125#(= |ULTIMATE.start_main_~s~0#1| (mod |ULTIMATE.start_main_~v~0#1| 256))} is VALID [2022-02-20 17:09:35,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {125#(= |ULTIMATE.start_main_~s~0#1| (mod |ULTIMATE.start_main_~v~0#1| 256))} assume main_~s~0#1 % 256 < main_~v~0#1 % 256; {110#false} is VALID [2022-02-20 17:09:35,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 17:09:35,998 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:35,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:36,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 17:09:36,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {112#(<= (+ |ULTIMATE.start_main_~v~0#1| (* (div |ULTIMATE.start_main_~s~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|))} assume main_~s~0#1 % 256 < main_~v~0#1 % 256; {110#false} is VALID [2022-02-20 17:09:36,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {112#(<= (+ |ULTIMATE.start_main_~v~0#1| (* (div |ULTIMATE.start_main_~s~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {112#(<= (+ |ULTIMATE.start_main_~v~0#1| (* (div |ULTIMATE.start_main_~s~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:36,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {144#(<= (div (mod |ULTIMATE.start_main_~s~0#1| 256) (- 256)) (+ (div (+ (- 256) (* (- 1) (mod |ULTIMATE.start_main_~s~0#1| 256))) 256) 1))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 % 256 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {112#(<= (+ |ULTIMATE.start_main_~v~0#1| (* (div |ULTIMATE.start_main_~s~0#1| 256) 256)) (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:36,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {144#(<= (div (mod |ULTIMATE.start_main_~s~0#1| 256) (- 256)) (+ (div (+ (- 256) (* (- 1) (mod |ULTIMATE.start_main_~s~0#1| 256))) 256) 1))} is VALID [2022-02-20 17:09:36,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {109#true} is VALID [2022-02-20 17:09:36,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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(26, 2);call #Ultimate.allocInit(12, 3); {109#true} is VALID [2022-02-20 17:09:36,825 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:36,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809962925] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:36,826 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:36,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-02-20 17:09:36,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483609354] [2022-02-20 17:09:36,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:36,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:09:36,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:36,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:36,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:36,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:09:36,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:36,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:09:36,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:09:36,841 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:36,910 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-20 17:09:36,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:09:36,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:09:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-20 17:09:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-20 17:09:36,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 12 transitions. [2022-02-20 17:09:36,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:36,929 INFO L225 Difference]: With dead ends: 12 [2022-02-20 17:09:36,929 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 17:09:36,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:09:36,931 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:36,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 17:09:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 17:09:36,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:36,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:36,936 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:36,937 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:36,937 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 17:09:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:09:36,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:36,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:36,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 17:09:36,939 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 17:09:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:36,939 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 17:09:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:09:36,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:36,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:36,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:36,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 17:09:36,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-02-20 17:09:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:36,942 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 17:09:36,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:09:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:09:36,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:36,943 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:36,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:37,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:37,158 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:37,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash 183224107, now seen corresponding path program 2 times [2022-02-20 17:09:37,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:37,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057847096] [2022-02-20 17:09:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:37,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:09:37,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:09:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:09:37,216 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:09:37,216 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:09:37,217 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 17:09:37,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 17:09:37,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:09:37,226 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-02-20 17:09:37,232 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:09:37,250 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:09:37,250 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:09:37,250 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:09:37,251 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:09:37,251 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 17:09:37,251 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:09:37,252 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:09:37,252 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:09:37,252 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:09:37,253 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2022-02-20 17:09:37,253 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2022-02-20 17:09:37,253 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:09:37,253 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:09:37,253 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 17:09:37,253 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 17:09:37,253 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 17:09:37,253 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 17:09:37,254 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:37,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:09:37 BoogieIcfgContainer [2022-02-20 17:09:37,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:09:37,256 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:09:37,256 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:09:37,256 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:09:37,257 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:35" (3/4) ... [2022-02-20 17:09:37,258 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 17:09:37,292 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:09:37,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:09:37,293 INFO L158 Benchmark]: Toolchain (without parser) took 2736.13ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.6MB in the beginning and 63.5MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:37,293 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:37,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.34ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.4MB in the beginning and 77.2MB in the end (delta: -30.8MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-02-20 17:09:37,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.69ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 75.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:09:37,294 INFO L158 Benchmark]: Boogie Preprocessor took 28.50ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 74.7MB in the end (delta: 894.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:09:37,294 INFO L158 Benchmark]: RCFGBuilder took 225.86ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 65.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:09:37,295 INFO L158 Benchmark]: TraceAbstraction took 2157.64ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 65.7MB in the end (delta: -746.3kB). Peak memory consumption was 554.9kB. Max. memory is 16.1GB. [2022-02-20 17:09:37,295 INFO L158 Benchmark]: Witness Printer took 36.04ms. Allocated memory is still 100.7MB. Free memory was 65.7MB in the beginning and 63.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:09:37,296 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.21ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.34ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.4MB in the beginning and 77.2MB in the end (delta: -30.8MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.69ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 75.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.50ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 74.7MB in the end (delta: 894.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 225.86ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 65.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2157.64ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 65.7MB in the end (delta: -746.3kB). Peak memory consumption was 554.9kB. Max. memory is 16.1GB. * Witness Printer took 36.04ms. Allocated memory is still 100.7MB. Free memory was 65.7MB in the beginning and 63.5MB in the end (delta: 2.1MB). 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5] unsigned char n = __VERIFIER_nondet_uchar(); [L6] COND FALSE !(n == 0) [L9] unsigned char v = 0; [L10] unsigned char s = 0; [L11] unsigned int i = 0; VAL [i=0, n=2, s=0, v=0] [L12] COND TRUE i < n [L13] v = __VERIFIER_nondet_uchar() [L14] s += v [L15] ++i VAL [i=1, n=2, s=255, v=255] [L12] COND TRUE i < n [L13] v = __VERIFIER_nondet_uchar() [L14] s += v [L15] ++i VAL [i=2, n=2, s=0, v=1] [L12] COND FALSE !(i < n) VAL [i=2, n=2, s=0, v=1] [L17] COND TRUE s < v VAL [i=2, n=2, s=0, v=1] [L18] reach_error() VAL [i=2, n=2, s=0, v=1] - UnprovableResult [Line: 22]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, 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, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 24 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 123 SizeOfPredicates, 2 NumberOfNonLiveVariables, 43 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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 proved your program to be incorrect! [2022-02-20 17:09:37,312 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE