./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/indp3f.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/array-fpi/indp3f.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 e65fcf75bc449caf1adc12b98cf1df32d7807702ccc9a83118e61ee3faf8aa64 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:29:50,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:29:50,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:29:50,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:29:50,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:29:50,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:29:50,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:29:50,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:29:50,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:29:50,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:29:50,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:29:50,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:29:50,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:29:50,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:29:50,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:29:50,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:29:50,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:29:50,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:29:50,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:29:50,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:29:50,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:29:50,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:29:50,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:29:50,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:29:50,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:29:50,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:29:50,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:29:50,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:29:50,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:29:50,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:29:50,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:29:50,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:29:50,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:29:50,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:29:50,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:29:50,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:29:50,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:29:50,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:29:50,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:29:50,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:29:50,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:29:50,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:29:50,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:29:50,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:29:50,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:29:50,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:29:50,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:29:50,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:29:50,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:29:50,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:29:50,742 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:29:50,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:29:50,743 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:29:50,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:29:50,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:29:50,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:29:50,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:29:50,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:29:50,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:29:50,744 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:29:50,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:29:50,744 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:29:50,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:29:50,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:29:50,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:29:50,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:29:50,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:29:50,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:29:50,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:29:50,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:29:50,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:29:50,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:29:50,746 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:29:50,747 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:29:50,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:29:50,747 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 -> e65fcf75bc449caf1adc12b98cf1df32d7807702ccc9a83118e61ee3faf8aa64 [2022-02-20 14:29:50,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:29:51,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:29:51,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:29:51,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:29:51,022 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:29:51,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/indp3f.c [2022-02-20 14:29:51,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc0dc452/cd9c5a69514c4e77b0e971343070fdc5/FLAG56573e3a8 [2022-02-20 14:29:51,633 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:29:51,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp3f.c [2022-02-20 14:29:51,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc0dc452/cd9c5a69514c4e77b0e971343070fdc5/FLAG56573e3a8 [2022-02-20 14:29:52,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc0dc452/cd9c5a69514c4e77b0e971343070fdc5 [2022-02-20 14:29:52,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:29:52,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:29:52,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:29:52,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:29:52,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:29:52,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb54bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52, skipping insertion in model container [2022-02-20 14:29:52,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:29:52,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:29:52,337 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/array-fpi/indp3f.c[589,602] [2022-02-20 14:29:52,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:29:52,378 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:29:52,391 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/array-fpi/indp3f.c[589,602] [2022-02-20 14:29:52,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:29:52,420 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:29:52,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52 WrapperNode [2022-02-20 14:29:52,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:29:52,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:29:52,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:29:52,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:29:52,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,463 INFO L137 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2022-02-20 14:29:52,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:29:52,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:29:52,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:29:52,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:29:52,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:29:52,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:29:52,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:29:52,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:29:52,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (1/1) ... [2022-02-20 14:29:52,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:29:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:52,515 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 14:29:52,532 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 14:29:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:29:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:29:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:29:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:29:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:29:52,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:29:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:29:52,585 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:29:52,586 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:29:52,751 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:29:52,761 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:29:52,761 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 14:29:52,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:29:52 BoogieIcfgContainer [2022-02-20 14:29:52,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:29:52,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:29:52,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:29:52,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:29:52,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:29:52" (1/3) ... [2022-02-20 14:29:52,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f45dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:29:52, skipping insertion in model container [2022-02-20 14:29:52,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:52" (2/3) ... [2022-02-20 14:29:52,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f45dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:29:52, skipping insertion in model container [2022-02-20 14:29:52,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:29:52" (3/3) ... [2022-02-20 14:29:52,778 INFO L111 eAbstractionObserver]: Analyzing ICFG indp3f.c [2022-02-20 14:29:52,782 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:29:52,783 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:29:52,837 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:29:52,844 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 14:29:52,845 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:29:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:29:52,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:52,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:52,871 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-02-20 14:29:52,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:52,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446082707] [2022-02-20 14:29:52,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:52,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:53,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {30#true} is VALID [2022-02-20 14:29:53,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {30#true} is VALID [2022-02-20 14:29:53,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {30#true} is VALID [2022-02-20 14:29:53,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {31#false} is VALID [2022-02-20 14:29:53,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#false} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:29:53,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume !(main_~i~0#1 < ~N~0); {31#false} is VALID [2022-02-20 14:29:53,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:29:53,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} assume !(main_~i~0#1 < ~N~0); {31#false} is VALID [2022-02-20 14:29:53,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:29:53,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume !(main_~i~0#1 < ~N~0); {31#false} is VALID [2022-02-20 14:29:53,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:29:53,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} assume !true; {31#false} is VALID [2022-02-20 14:29:53,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:29:53,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem14#1 == 1 + main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {31#false} is VALID [2022-02-20 14:29:53,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} assume 0 == __VERIFIER_assert_~cond#1; {31#false} is VALID [2022-02-20 14:29:53,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 14:29:53,059 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 14:29:53,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:53,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446082707] [2022-02-20 14:29:53,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446082707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:53,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:53,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:29:53,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128377892] [2022-02-20 14:29:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:29:53,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:53,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:53,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:29:53,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:29:53,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:29:53,140 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:53,190 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-02-20 14:29:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:29:53,191 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:29:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 14:29:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 14:29:53,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2022-02-20 14:29:53,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:53,274 INFO L225 Difference]: With dead ends: 50 [2022-02-20 14:29:53,275 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 14:29:53,278 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 14:29:53,280 INFO L933 BasicCegarLoop]: 32 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, 32 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 14:29:53,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:29:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 14:29:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 14:29:53,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:53,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,305 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,306 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:53,308 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 14:29:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:29:53,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:53,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:53,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 14:29:53,309 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 14:29:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:53,311 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 14:29:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:29:53,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:53,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:53,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:53,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 14:29:53,314 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-02-20 14:29:53,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:53,315 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 14:29:53,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:29:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:29:53,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:53,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:53,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:29:53,317 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:53,318 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-02-20 14:29:53,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:53,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436111685] [2022-02-20 14:29:53,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:53,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:53,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {170#true} is VALID [2022-02-20 14:29:53,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {170#true} is VALID [2022-02-20 14:29:53,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {172#(<= 1 ~N~0)} is VALID [2022-02-20 14:29:53,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {172#(<= 1 ~N~0)} is VALID [2022-02-20 14:29:53,382 INFO L290 TraceCheckUtils]: 4: Hoare triple {172#(<= 1 ~N~0)} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~0#1 := 0; {173#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} is VALID [2022-02-20 14:29:53,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} assume !(main_~i~0#1 < ~N~0); {171#false} is VALID [2022-02-20 14:29:53,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#false} main_~i~0#1 := 0; {171#false} is VALID [2022-02-20 14:29:53,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {171#false} assume !(main_~i~0#1 < ~N~0); {171#false} is VALID [2022-02-20 14:29:53,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#false} main_~i~0#1 := 0; {171#false} is VALID [2022-02-20 14:29:53,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#false} assume !(main_~i~0#1 < ~N~0); {171#false} is VALID [2022-02-20 14:29:53,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#false} main_~i~0#1 := 0; {171#false} is VALID [2022-02-20 14:29:53,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#false} assume !(main_~i~0#1 < ~N~0); {171#false} is VALID [2022-02-20 14:29:53,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {171#false} main_~i~0#1 := 0; {171#false} is VALID [2022-02-20 14:29:53,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {171#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem14#1 == 1 + main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {171#false} is VALID [2022-02-20 14:29:53,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {171#false} assume 0 == __VERIFIER_assert_~cond#1; {171#false} is VALID [2022-02-20 14:29:53,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {171#false} assume !false; {171#false} is VALID [2022-02-20 14:29:53,386 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 14:29:53,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:53,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436111685] [2022-02-20 14:29:53,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436111685] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:53,387 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:53,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:29:53,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396013764] [2022-02-20 14:29:53,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:53,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:29:53,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:53,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:53,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:29:53,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:53,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:29:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:29:53,420 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:53,518 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-02-20 14:29:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:29:53,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:29:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-02-20 14:29:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-02-20 14:29:53,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-02-20 14:29:53,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:53,576 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:29:53,576 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:29:53,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:29:53,577 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:53,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:29:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:29:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-02-20 14:29:53,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:53,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,588 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,588 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:53,589 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-20 14:29:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-20 14:29:53,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:53,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:53,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 14:29:53,590 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 14:29:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:53,592 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-20 14:29:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-20 14:29:53,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:53,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:53,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:53,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-02-20 14:29:53,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-02-20 14:29:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:53,595 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-02-20 14:29:53,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:29:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:29:53,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:53,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:53,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:29:53,597 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-02-20 14:29:53,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:53,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413214731] [2022-02-20 14:29:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:53,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:53,616 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:53,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942360914] [2022-02-20 14:29:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:53,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:53,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:53,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:29:53,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:29:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:29:53,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 14:29:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:29:53,710 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 14:29:53,710 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 14:29:53,711 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:29:53,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:29:53,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:53,935 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 14:29:53,937 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:29:53,972 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:29:53,972 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:29:53,972 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:29:53,972 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:29:53,972 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 14:29:53,972 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:29:53,973 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:29:53,973 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:29:53,973 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 14:29:53,973 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-02-20 14:29:53,973 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-02-20 14:29:53,973 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-02-20 14:29:53,973 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2022-02-20 14:29:53,973 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-02-20 14:29:53,974 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-02-20 14:29:53,974 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-02-20 14:29:53,974 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-02-20 14:29:53,974 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-02-20 14:29:53,974 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 14:29:53,974 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 14:29:53,974 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 14:29:53,974 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 14:29:53,974 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2022-02-20 14:29:53,975 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 14:29:53,975 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-02-20 14:29:53,975 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-02-20 14:29:53,975 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-02-20 14:29:53,975 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2022-02-20 14:29:53,975 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-02-20 14:29:53,975 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 14:29:53,975 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 14:29:53,976 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 14:29:53,976 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2022-02-20 14:29:53,976 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:29:53,976 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:29:53,976 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:29:53,976 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:29:53,976 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2022-02-20 14:29:53,976 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 14:29:53,976 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:29:53,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:29:53 BoogieIcfgContainer [2022-02-20 14:29:53,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:29:53,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:29:53,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:29:53,978 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:29:53,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:29:52" (3/4) ... [2022-02-20 14:29:53,980 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 14:29:54,035 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:29:54,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:29:54,036 INFO L158 Benchmark]: Toolchain (without parser) took 1906.17ms. Allocated memory is still 155.2MB. Free memory was 120.4MB in the beginning and 128.0MB in the end (delta: -7.6MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2022-02-20 14:29:54,036 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:29:54,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.85ms. Allocated memory is still 155.2MB. Free memory was 120.1MB in the beginning and 128.4MB in the end (delta: -8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:29:54,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.31ms. Allocated memory is still 155.2MB. Free memory was 128.4MB in the beginning and 126.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:29:54,038 INFO L158 Benchmark]: Boogie Preprocessor took 26.32ms. Allocated memory is still 155.2MB. Free memory was 126.4MB in the beginning and 125.4MB in the end (delta: 944.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:29:54,038 INFO L158 Benchmark]: RCFGBuilder took 273.73ms. Allocated memory is still 155.2MB. Free memory was 125.4MB in the beginning and 112.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:29:54,038 INFO L158 Benchmark]: TraceAbstraction took 1208.24ms. Allocated memory is still 155.2MB. Free memory was 111.7MB in the beginning and 46.7MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2022-02-20 14:29:54,038 INFO L158 Benchmark]: Witness Printer took 57.39ms. Allocated memory is still 155.2MB. Free memory was 46.3MB in the beginning and 129.0MB in the end (delta: -82.6MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-02-20 14:29:54,040 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.17ms. Allocated memory is still 81.8MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.85ms. Allocated memory is still 155.2MB. Free memory was 120.1MB in the beginning and 128.4MB in the end (delta: -8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.31ms. Allocated memory is still 155.2MB. Free memory was 128.4MB in the beginning and 126.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.32ms. Allocated memory is still 155.2MB. Free memory was 126.4MB in the beginning and 125.4MB in the end (delta: 944.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 273.73ms. Allocated memory is still 155.2MB. Free memory was 125.4MB in the beginning and 112.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1208.24ms. Allocated memory is still 155.2MB. Free memory was 111.7MB in the beginning and 46.7MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Witness Printer took 57.39ms. Allocated memory is still 155.2MB. Free memory was 46.3MB in the beginning and 129.0MB in the end (delta: -82.6MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long *a = malloc(sizeof(long long)*N); [L30] i=0 VAL [a={-1:0}, i=0, N=1] [L30] COND TRUE i