./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/for_bounded_loop1.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/loops/for_bounded_loop1.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 d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:59:03,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:59:03,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:59:03,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:59:03,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:59:03,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:59:03,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:59:03,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:59:03,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:59:03,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:59:03,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:59:03,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:59:03,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:59:03,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:59:03,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:59:03,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:59:03,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:59:03,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:59:03,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:59:03,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:59:03,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:59:03,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:59:03,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:59:03,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:59:03,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:59:03,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:59:03,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:59:03,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:59:03,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:59:03,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:59:03,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:59:03,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:59:03,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:59:03,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:59:03,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:59:03,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:59:03,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:59:03,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:59:03,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:59:03,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:59:03,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:59:03,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:59:04,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:59:04,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:59:04,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:59:04,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:59:04,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:59:04,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:59:04,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:59:04,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:59:04,022 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:59:04,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:59:04,023 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:59:04,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:59:04,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:59:04,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:59:04,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:59:04,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:59:04,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:59:04,024 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:59:04,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:59:04,025 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:59:04,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:59:04,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:59:04,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:59:04,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:59:04,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:04,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:59:04,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:59:04,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:59:04,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:59:04,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:59:04,031 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:59:04,031 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:59:04,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:59:04,032 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 -> d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 [2022-02-20 16:59:04,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:59:04,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:59:04,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:59:04,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:59:04,263 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:59:04,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/for_bounded_loop1.c [2022-02-20 16:59:04,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130a397bc/397e7f8a638c40c8bb40fdb5983f5ccb/FLAGfb2453a7b [2022-02-20 16:59:04,696 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:59:04,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c [2022-02-20 16:59:04,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130a397bc/397e7f8a638c40c8bb40fdb5983f5ccb/FLAGfb2453a7b [2022-02-20 16:59:04,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130a397bc/397e7f8a638c40c8bb40fdb5983f5ccb [2022-02-20 16:59:04,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:59:04,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:59:04,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:04,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:59:04,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:59:04,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@811620a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04, skipping insertion in model container [2022-02-20 16:59:04,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:59:04,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:59:04,854 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/loops/for_bounded_loop1.c[416,429] [2022-02-20 16:59:04,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:04,881 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:59:04,898 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/loops/for_bounded_loop1.c[416,429] [2022-02-20 16:59:04,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:04,910 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:59:04,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04 WrapperNode [2022-02-20 16:59:04,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:04,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:04,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:59:04,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:59:04,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,931 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 16:59:04,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:04,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:59:04,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:59:04,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:59:04,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:59:04,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:59:04,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:59:04,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:59:04,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (1/1) ... [2022-02-20 16:59:04,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:04,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:04,987 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 16:59:04,988 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 16:59:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:59:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:59:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:59:05,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:59:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 16:59:05,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 16:59:05,059 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:59:05,061 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:59:05,162 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:59:05,179 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:59:05,180 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:59:05,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:05 BoogieIcfgContainer [2022-02-20 16:59:05,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:59:05,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:59:05,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:59:05,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:59:05,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:59:04" (1/3) ... [2022-02-20 16:59:05,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c9dfc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:05, skipping insertion in model container [2022-02-20 16:59:05,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:04" (2/3) ... [2022-02-20 16:59:05,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c9dfc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:05, skipping insertion in model container [2022-02-20 16:59:05,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:05" (3/3) ... [2022-02-20 16:59:05,187 INFO L111 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2022-02-20 16:59:05,191 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:59:05,191 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:59:05,223 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:59:05,228 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 16:59:05,228 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:59:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:59:05,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:05,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:05,262 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash 194354858, now seen corresponding path program 1 times [2022-02-20 16:59:05,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:05,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842330686] [2022-02-20 16:59:05,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:05,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:05,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#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(20, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-02-20 16:59:05,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;main_~i~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 0;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {22#true} is VALID [2022-02-20 16:59:05,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume !!(main_~n~0#1 > 0);main_~i~0#1 := 0; {22#true} is VALID [2022-02-20 16:59:05,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-02-20 16:59:05,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#false} call __VERIFIER_assert((if 0 == main_~x~0#1 then 1 else 0)); {23#false} is VALID [2022-02-20 16:59:05,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-02-20 16:59:05,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-02-20 16:59:05,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 16:59:05,402 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 16:59:05,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:05,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842330686] [2022-02-20 16:59:05,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842330686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:05,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:05,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:59:05,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496132452] [2022-02-20 16:59:05,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:05,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:05,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:05,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:05,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:59:05,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:59:05,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:59:05,449 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:05,481 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-02-20 16:59:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:59:05,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 16:59:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 16:59:05,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2022-02-20 16:59:05,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:05,548 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:59:05,548 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:59:05,550 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 16:59:05,553 INFO L933 BasicCegarLoop]: 23 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, 23 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 16:59:05,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:59:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:59:05,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:05,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:05,573 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:05,573 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:05,576 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 16:59:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 16:59:05,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:05,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:05,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 16:59:05,577 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 16:59:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:05,579 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 16:59:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 16:59:05,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:05,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:05,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:05,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-20 16:59:05,584 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2022-02-20 16:59:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:05,584 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-20 16:59:05,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 16:59:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:59:05,585 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:05,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:05,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:59:05,586 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:05,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash 181425564, now seen corresponding path program 1 times [2022-02-20 16:59:05,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:05,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471602031] [2022-02-20 16:59:05,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:05,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#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(20, 2);call #Ultimate.allocInit(12, 3); {126#true} is VALID [2022-02-20 16:59:05,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;main_~i~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 0;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {126#true} is VALID [2022-02-20 16:59:05,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} assume !!(main_~n~0#1 > 0);main_~i~0#1 := 0; {128#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:05,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {128#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 < main_~n~0#1); {127#false} is VALID [2022-02-20 16:59:05,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#false} call __VERIFIER_assert((if 0 == main_~x~0#1 then 1 else 0)); {127#false} is VALID [2022-02-20 16:59:05,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#false} ~cond := #in~cond; {127#false} is VALID [2022-02-20 16:59:05,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#false} assume 0 == ~cond; {127#false} is VALID [2022-02-20 16:59:05,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {127#false} assume !false; {127#false} is VALID [2022-02-20 16:59:05,638 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 16:59:05,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:05,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471602031] [2022-02-20 16:59:05,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471602031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:05,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:05,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:59:05,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510740763] [2022-02-20 16:59:05,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:05,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:05,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:05,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:05,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:59:05,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:05,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:59:05,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:59:05,650 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:05,702 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:59:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:59:05,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-20 16:59:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-20 16:59:05,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-02-20 16:59:05,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:05,752 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:59:05,752 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:59:05,755 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 16:59:05,757 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:05,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:59:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-02-20 16:59:05,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:05,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:05,767 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:05,767 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:05,769 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:59:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:59:05,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:05,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:05,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 16:59:05,769 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 16:59:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:05,771 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:59:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:59:05,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:05,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:05,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:05,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-20 16:59:05,773 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 8 [2022-02-20 16:59:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:05,773 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-20 16:59:05,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-20 16:59:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:59:05,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:05,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:05,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:59:05,774 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash 183153442, now seen corresponding path program 1 times [2022-02-20 16:59:05,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:05,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133326308] [2022-02-20 16:59:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:05,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#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(20, 2);call #Ultimate.allocInit(12, 3); {237#true} is VALID [2022-02-20 16:59:05,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;main_~i~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 0;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {239#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 16:59:05,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~n~0#1 > 0);main_~i~0#1 := 0; {239#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 16:59:05,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {239#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~i~0#1 < main_~n~0#1);main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {240#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 16:59:05,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == main_~x~0#1 then 1 else 0)); {241#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 16:59:05,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {242#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 16:59:05,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {242#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {238#false} is VALID [2022-02-20 16:59:05,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#false} assume !false; {238#false} is VALID [2022-02-20 16:59:05,856 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 16:59:05,856 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:05,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133326308] [2022-02-20 16:59:05,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133326308] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:05,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:05,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:59:05,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315319772] [2022-02-20 16:59:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:05,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:05,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:05,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:05,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:59:05,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:05,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:59:05,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:59:05,871 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:05,942 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 16:59:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:59:05,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 16:59:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 16:59:05,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-02-20 16:59:05,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:05,967 INFO L225 Difference]: With dead ends: 26 [2022-02-20 16:59:05,967 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:59:05,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:59:05,968 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:05,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:59:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-02-20 16:59:05,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:05,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:05,972 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:05,972 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:05,973 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 16:59:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 16:59:05,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:05,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:05,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 16:59:05,974 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 16:59:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:05,975 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 16:59:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 16:59:05,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:05,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:05,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:05,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 16:59:05,982 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2022-02-20 16:59:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:05,982 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 16:59:05,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 16:59:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:59:05,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:05,983 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:05,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:59:05,984 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:05,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1335896453, now seen corresponding path program 1 times [2022-02-20 16:59:05,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:05,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068075979] [2022-02-20 16:59:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:05,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 16:59:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:06,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {359#true} ~cond := #in~cond; {359#true} is VALID [2022-02-20 16:59:06,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {359#true} assume !(0 == ~cond); {359#true} is VALID [2022-02-20 16:59:06,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {359#true} assume true; {359#true} is VALID [2022-02-20 16:59:06,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {359#true} {362#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} #45#return; {362#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 16:59:06,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {359#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(20, 2);call #Ultimate.allocInit(12, 3); {359#true} is VALID [2022-02-20 16:59:06,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {359#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;main_~i~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 0;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {361#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 16:59:06,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~n~0#1 > 0);main_~i~0#1 := 0; {361#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 16:59:06,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {361#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~i~0#1 < main_~n~0#1);main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {362#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 16:59:06,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {362#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == main_~x~0#1 then 1 else 0)); {359#true} is VALID [2022-02-20 16:59:06,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {359#true} ~cond := #in~cond; {359#true} is VALID [2022-02-20 16:59:06,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {359#true} assume !(0 == ~cond); {359#true} is VALID [2022-02-20 16:59:06,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#true} assume true; {359#true} is VALID [2022-02-20 16:59:06,103 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {359#true} {362#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} #45#return; {362#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 16:59:06,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~y~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {362#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 16:59:06,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#(and (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(0 != main_~y~0#1);main_~x~0#1 := main_~x~0#1 + main_~y~0#1; {367#(or (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0))} is VALID [2022-02-20 16:59:06,105 INFO L272 TraceCheckUtils]: 11: Hoare triple {367#(or (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0))} call __VERIFIER_assert((if 0 != main_~x~0#1 then 1 else 0)); {368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 16:59:06,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {369#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 16:59:06,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {360#false} is VALID [2022-02-20 16:59:06,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {360#false} assume !false; {360#false} is VALID [2022-02-20 16:59:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:06,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:06,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068075979] [2022-02-20 16:59:06,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068075979] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:06,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:06,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:59:06,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442696567] [2022-02-20 16:59:06,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:06,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:59:06,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:06,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:06,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:06,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:59:06,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:06,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:59:06,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:59:06,128 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:06,290 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 16:59:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:59:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:59:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-02-20 16:59:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-02-20 16:59:06,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2022-02-20 16:59:06,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:06,328 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:59:06,328 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:59:06,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:59:06,335 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:06,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 74 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:59:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-02-20 16:59:06,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:06,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:59:06,347 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:59:06,348 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:59:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:06,351 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 16:59:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 16:59:06,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:06,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:06,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-02-20 16:59:06,353 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-02-20 16:59:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:06,357 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 16:59:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 16:59:06,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:06,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:06,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:06,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:59:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 16:59:06,359 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 15 [2022-02-20 16:59:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:06,359 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 16:59:06,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 16:59:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:59:06,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:06,360 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:06,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:59:06,360 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:06,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1291608463, now seen corresponding path program 1 times [2022-02-20 16:59:06,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:06,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910967775] [2022-02-20 16:59:06,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:59:06,375 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:59:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:59:06,415 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:59:06,415 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:59:06,416 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:59:06,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:59:06,419 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 16:59:06,421 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:59:06,439 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); [2022-02-20 16:59:06,439 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:59:06,441 INFO L158 Benchmark]: Toolchain (without parser) took 1722.33ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.3MB in the beginning and 70.6MB in the end (delta: -19.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:59:06,442 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 56.3MB in the end (delta: 25.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:59:06,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.37ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.2MB in the beginning and 80.8MB in the end (delta: -29.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 16:59:06,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.57ms. Allocated memory is still 104.9MB. Free memory was 80.8MB in the beginning and 79.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:59:06,442 INFO L158 Benchmark]: Boogie Preprocessor took 23.52ms. Allocated memory is still 104.9MB. Free memory was 79.4MB in the beginning and 78.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:59:06,442 INFO L158 Benchmark]: RCFGBuilder took 224.17ms. Allocated memory is still 104.9MB. Free memory was 78.2MB in the beginning and 68.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:59:06,442 INFO L158 Benchmark]: TraceAbstraction took 1258.26ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 70.6MB in the end (delta: -2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:59:06,443 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.13ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 56.3MB in the end (delta: 25.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.37ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.2MB in the beginning and 80.8MB in the end (delta: -29.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.57ms. Allocated memory is still 104.9MB. Free memory was 80.8MB in the beginning and 79.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.52ms. Allocated memory is still 104.9MB. Free memory was 79.4MB in the beginning and 78.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 224.17ms. Allocated memory is still 104.9MB. Free memory was 78.2MB in the beginning and 68.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1258.26ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 70.6MB in the end (delta: -2.9MB). 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:59:06,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/loops/for_bounded_loop1.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 d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:59:08,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:59:08,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:59:08,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:59:08,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:59:08,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:59:08,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:59:08,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:59:08,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:59:08,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:59:08,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:59:08,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:59:08,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:59:08,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:59:08,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:59:08,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:59:08,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:59:08,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:59:08,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:59:08,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:59:08,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:59:08,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:59:08,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:59:08,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:59:08,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:59:08,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:59:08,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:59:08,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:59:08,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:59:08,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:59:08,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:59:08,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:59:08,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:59:08,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:59:08,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:59:08,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:59:08,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:59:08,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:59:08,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:59:08,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:59:08,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:59:08,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:59:08,282 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:59:08,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:59:08,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:59:08,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:59:08,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:59:08,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:59:08,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:59:08,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:59:08,285 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:59:08,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:59:08,286 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:59:08,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:59:08,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:59:08,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:59:08,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:59:08,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:59:08,287 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:59:08,287 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:59:08,287 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:59:08,287 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:59:08,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:59:08,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:59:08,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:59:08,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:59:08,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:59:08,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:59:08,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:08,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:59:08,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:59:08,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:59:08,289 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:59:08,290 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:59:08,290 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:59:08,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:59:08,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:59:08,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:59:08,291 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 -> d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 [2022-02-20 16:59:08,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:59:08,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:59:08,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:59:08,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:59:08,553 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:59:08,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/for_bounded_loop1.c [2022-02-20 16:59:08,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161251e26/7f79575220ea4df5b123b656167a63da/FLAGd755e3864 [2022-02-20 16:59:08,996 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:59:08,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c [2022-02-20 16:59:09,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161251e26/7f79575220ea4df5b123b656167a63da/FLAGd755e3864 [2022-02-20 16:59:09,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161251e26/7f79575220ea4df5b123b656167a63da [2022-02-20 16:59:09,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:59:09,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:59:09,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:09,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:59:09,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:59:09,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4748b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09, skipping insertion in model container [2022-02-20 16:59:09,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:59:09,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:59:09,153 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/loops/for_bounded_loop1.c[416,429] [2022-02-20 16:59:09,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:09,186 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:59:09,213 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/loops/for_bounded_loop1.c[416,429] [2022-02-20 16:59:09,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:09,235 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:59:09,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09 WrapperNode [2022-02-20 16:59:09,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:09,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:09,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:59:09,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:59:09,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,266 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-20 16:59:09,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:09,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:59:09,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:59:09,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:59:09,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:59:09,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:59:09,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:59:09,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:59:09,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (1/1) ... [2022-02-20 16:59:09,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:09,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:09,349 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 16:59:09,367 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 16:59:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:59:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:59:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:59:09,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:59:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 16:59:09,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 16:59:09,439 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:59:09,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:59:09,583 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:59:09,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:59:09,588 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:59:09,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:09 BoogieIcfgContainer [2022-02-20 16:59:09,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:59:09,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:59:09,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:59:09,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:59:09,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:59:09" (1/3) ... [2022-02-20 16:59:09,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e60a664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:09, skipping insertion in model container [2022-02-20 16:59:09,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:09" (2/3) ... [2022-02-20 16:59:09,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e60a664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:09, skipping insertion in model container [2022-02-20 16:59:09,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:09" (3/3) ... [2022-02-20 16:59:09,605 INFO L111 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2022-02-20 16:59:09,609 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:59:09,609 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:59:09,650 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:59:09,654 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 16:59:09,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:59:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:59:09,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:09,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:09,690 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash 194354858, now seen corresponding path program 1 times [2022-02-20 16:59:09,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:59:09,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259677700] [2022-02-20 16:59:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:09,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:59:09,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:59:09,711 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 16:59:09,713 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 16:59:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:09,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:59:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:09,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:09,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {22#true} is VALID [2022-02-20 16:59:09,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;main_~i~0#1 := 0bv32;main_~x~0#1 := 0bv32;main_~y~0#1 := 0bv32;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {22#true} is VALID [2022-02-20 16:59:09,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume !!~bvsgt32(main_~n~0#1, 0bv32);main_~i~0#1 := 0bv32; {22#true} is VALID [2022-02-20 16:59:09,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-02-20 16:59:09,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#false} call __VERIFIER_assert((if 0bv32 == main_~x~0#1 then 1bv32 else 0bv32)); {23#false} is VALID [2022-02-20 16:59:09,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-02-20 16:59:09,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} assume 0bv32 == ~cond; {23#false} is VALID [2022-02-20 16:59:09,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 16:59:09,839 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 16:59:09,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:59:09,840 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:59:09,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259677700] [2022-02-20 16:59:09,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259677700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:09,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:09,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:59:09,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175072153] [2022-02-20 16:59:09,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:09,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:09,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:09,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:09,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:59:09,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:59:09,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:59:09,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:59:09,885 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:09,958 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-02-20 16:59:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:59:09,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 16:59:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 16:59:09,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2022-02-20 16:59:10,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:10,052 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:59:10,053 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:59:10,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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 16:59:10,057 INFO L933 BasicCegarLoop]: 23 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, 23 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 16:59:10,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:59:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:59:10,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:10,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:10,077 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:10,078 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:10,080 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 16:59:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 16:59:10,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:10,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:10,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 16:59:10,081 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 16:59:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:10,083 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 16:59:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 16:59:10,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:10,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:10,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:10,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-20 16:59:10,086 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2022-02-20 16:59:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:10,086 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-20 16:59:10,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 16:59:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:59:10,087 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:10,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:10,102 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 16:59:10,296 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 16:59:10,296 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:10,297 INFO L85 PathProgramCache]: Analyzing trace with hash 181425564, now seen corresponding path program 1 times [2022-02-20 16:59:10,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:59:10,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883648668] [2022-02-20 16:59:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:10,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:59:10,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:59:10,299 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 16:59:10,301 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 16:59:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:10,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:59:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:10,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:10,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {147#true} is VALID [2022-02-20 16:59:10,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;main_~i~0#1 := 0bv32;main_~x~0#1 := 0bv32;main_~y~0#1 := 0bv32;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {155#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} is VALID [2022-02-20 16:59:10,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} assume !!~bvsgt32(main_~n~0#1, 0bv32);main_~i~0#1 := 0bv32; {155#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} is VALID [2022-02-20 16:59:10,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} assume !~bvslt32(main_~i~0#1, main_~n~0#1); {155#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} is VALID [2022-02-20 16:59:10,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {155#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == main_~x~0#1 then 1bv32 else 0bv32)); {165#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 16:59:10,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {169#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 16:59:10,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {169#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {148#false} is VALID [2022-02-20 16:59:10,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-02-20 16:59:10,400 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 16:59:10,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:59:10,400 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:59:10,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883648668] [2022-02-20 16:59:10,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883648668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:10,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:10,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:59:10,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177485534] [2022-02-20 16:59:10,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:10,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:10,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:10,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:10,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:10,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:59:10,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:59:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:59:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:59:10,412 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:10,504 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 16:59:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:59:10,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-20 16:59:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-20 16:59:10,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-02-20 16:59:10,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:10,543 INFO L225 Difference]: With dead ends: 24 [2022-02-20 16:59:10,543 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 16:59:10,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:59:10,545 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:10,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 16:59:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 16:59:10,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:10,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:10,551 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:10,552 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:10,554 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-20 16:59:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-20 16:59:10,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:10,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:10,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-02-20 16:59:10,557 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-02-20 16:59:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:10,560 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-20 16:59:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-20 16:59:10,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:10,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:10,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:10,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:59:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-20 16:59:10,565 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 8 [2022-02-20 16:59:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:10,566 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-20 16:59:10,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-20 16:59:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:59:10,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:10,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:10,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:59:10,782 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 16:59:10,783 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:10,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash 183153442, now seen corresponding path program 1 times [2022-02-20 16:59:10,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:59:10,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944170811] [2022-02-20 16:59:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:10,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:59:10,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:59:10,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:59:10,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:59:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:10,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:59:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:10,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:10,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {266#true} is VALID [2022-02-20 16:59:10,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;main_~i~0#1 := 0bv32;main_~x~0#1 := 0bv32;main_~y~0#1 := 0bv32;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {274#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:59:11,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| (_ bv0 32)))} assume !!~bvsgt32(main_~n~0#1, 0bv32);main_~i~0#1 := 0bv32; {274#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:59:11,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {274#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~n~0#1);main_~x~0#1 := ~bvsub32(main_~x~0#1, main_~y~0#1); {281#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} is VALID [2022-02-20 16:59:11,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == main_~x~0#1 then 1bv32 else 0bv32)); {285#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 16:59:11,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {289#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 16:59:11,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {289#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {267#false} is VALID [2022-02-20 16:59:11,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 16:59:11,003 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 16:59:11,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:59:11,003 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:59:11,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944170811] [2022-02-20 16:59:11,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944170811] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:11,003 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:11,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:59:11,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993637927] [2022-02-20 16:59:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:11,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:11,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:11,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:11,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:11,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:59:11,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:59:11,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:59:11,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:59:11,017 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:11,107 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 16:59:11,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:59:11,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:59:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-02-20 16:59:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-02-20 16:59:11,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-02-20 16:59:11,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:11,135 INFO L225 Difference]: With dead ends: 26 [2022-02-20 16:59:11,135 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:59:11,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:59:11,136 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:11,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:59:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-02-20 16:59:11,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:11,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:11,139 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:11,139 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:11,140 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 16:59:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 16:59:11,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:11,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:11,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 16:59:11,141 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 16:59:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:11,142 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 16:59:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 16:59:11,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:11,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:11,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:11,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:59:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 16:59:11,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2022-02-20 16:59:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:11,144 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 16:59:11,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 16:59:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:59:11,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:11,145 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:11,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 16:59:11,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:59:11,353 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1335896453, now seen corresponding path program 1 times [2022-02-20 16:59:11,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:59:11,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014055993] [2022-02-20 16:59:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:11,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:59:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:59:11,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:59:11,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:59:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:11,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:59:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:11,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:11,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {409#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {409#true} is VALID [2022-02-20 16:59:11,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {409#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;main_~i~0#1 := 0bv32;main_~x~0#1 := 0bv32;main_~y~0#1 := 0bv32;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {417#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:59:11,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| (_ bv0 32)))} assume !!~bvsgt32(main_~n~0#1, 0bv32);main_~i~0#1 := 0bv32; {417#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:59:11,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {417#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~n~0#1);main_~x~0#1 := ~bvsub32(main_~x~0#1, main_~y~0#1); {424#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} is VALID [2022-02-20 16:59:11,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {424#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == main_~x~0#1 then 1bv32 else 0bv32)); {409#true} is VALID [2022-02-20 16:59:11,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2022-02-20 16:59:11,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {409#true} assume !(0bv32 == ~cond); {409#true} is VALID [2022-02-20 16:59:11,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#true} assume true; {409#true} is VALID [2022-02-20 16:59:11,502 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {409#true} {424#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} #45#return; {424#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} is VALID [2022-02-20 16:59:11,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {424#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} main_~y~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {424#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} is VALID [2022-02-20 16:59:11,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#(= |ULTIMATE.start_main_~x~0#1| (_ bv0 32))} assume !!(0bv32 != main_~y~0#1);main_~x~0#1 := ~bvadd32(main_~x~0#1, main_~y~0#1); {446#(not (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:59:11,504 INFO L272 TraceCheckUtils]: 11: Hoare triple {446#(not (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 != main_~x~0#1 then 1bv32 else 0bv32)); {450#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 16:59:11,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {450#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {454#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 16:59:11,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {410#false} is VALID [2022-02-20 16:59:11,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {410#false} assume !false; {410#false} is VALID [2022-02-20 16:59:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:11,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:59:11,505 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:59:11,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014055993] [2022-02-20 16:59:11,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014055993] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:11,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:11,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:59:11,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337910648] [2022-02-20 16:59:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:11,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:59:11,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:11,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:11,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:11,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:59:11,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:59:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:59:11,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:59:11,520 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:11,684 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 16:59:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:59:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:59:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 16:59:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 16:59:11,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-02-20 16:59:11,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:11,728 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:59:11,728 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:59:11,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:59:11,729 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:11,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:59:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:59:11,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-02-20 16:59:11,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:11,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:59:11,732 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:59:11,733 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:59:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:11,734 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 16:59:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 16:59:11,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:11,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:11,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-02-20 16:59:11,735 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-02-20 16:59:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:11,736 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 16:59:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 16:59:11,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:11,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:11,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:11,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:59:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 16:59:11,740 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 15 [2022-02-20 16:59:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:11,740 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 16:59:11,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:59:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 16:59:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:59:11,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:11,741 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:11,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:59:11,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:59:11,950 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1291608463, now seen corresponding path program 1 times [2022-02-20 16:59:11,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:59:11,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451639661] [2022-02-20 16:59:11,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:11,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:59:11,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:59:11,952 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:59:11,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:59:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:59:11,981 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:59:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:59:12,016 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 16:59:12,017 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:59:12,024 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:59:12,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:59:12,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:59:12,228 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 16:59:12,230 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:59:12,238 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); [2022-02-20 16:59:12,238 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:59:12,241 INFO L158 Benchmark]: Toolchain (without parser) took 3227.55ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 35.6MB in the beginning and 64.5MB in the end (delta: -28.8MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-02-20 16:59:12,241 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:59:12,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.84ms. Allocated memory is still 56.6MB. Free memory was 35.5MB in the beginning and 39.8MB in the end (delta: -4.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:59:12,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.65ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 38.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:59:12,242 INFO L158 Benchmark]: Boogie Preprocessor took 38.43ms. Allocated memory is still 56.6MB. Free memory was 38.1MB in the beginning and 37.1MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:59:12,242 INFO L158 Benchmark]: RCFGBuilder took 282.88ms. Allocated memory is still 56.6MB. Free memory was 36.9MB in the beginning and 27.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:59:12,242 INFO L158 Benchmark]: TraceAbstraction took 2649.43ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 26.8MB in the beginning and 64.5MB in the end (delta: -37.7MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-02-20 16:59:12,243 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.20ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.84ms. Allocated memory is still 56.6MB. Free memory was 35.5MB in the beginning and 39.8MB in the end (delta: -4.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.65ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 38.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.43ms. Allocated memory is still 56.6MB. Free memory was 38.1MB in the beginning and 37.1MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 282.88ms. Allocated memory is still 56.6MB. Free memory was 36.9MB in the beginning and 27.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2649.43ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 26.8MB in the beginning and 64.5MB in the end (delta: -37.7MB). Peak memory consumption was 17.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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:59:12,291 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: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator