./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ssinaf.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/ssinaf.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 ddcf6f6b8b47c7423a3bd6901a6e7495bbcabee1ee319bc4ff81e77a0ec22bd8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:34:22,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:34:22,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:34:22,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:34:22,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:34:22,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:34:22,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:34:22,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:34:22,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:34:22,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:34:22,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:34:22,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:34:22,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:34:22,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:34:22,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:34:22,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:34:22,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:34:22,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:34:22,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:34:22,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:34:22,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:34:22,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:34:22,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:34:22,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:34:22,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:34:22,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:34:22,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:34:22,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:34:22,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:34:22,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:34:22,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:34:22,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:34:22,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:34:22,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:34:22,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:34:22,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:34:22,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:34:22,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:34:22,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:34:22,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:34:22,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:34:22,932 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:34:22,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:34:22,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:34:22,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:34:22,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:34:22,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:34:22,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:34:22,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:34:22,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:34:22,964 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:34:22,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:34:22,965 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:34:22,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:34:22,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:34:22,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:34:22,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:34:22,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:34:22,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:34:22,966 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:34:22,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:34:22,966 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:34:22,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:34:22,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:34:22,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:34:22,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:34:22,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:34:22,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:34:22,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:34:22,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:34:22,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:34:22,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:34:22,968 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:34:22,968 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:34:22,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:34:22,968 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 -> ddcf6f6b8b47c7423a3bd6901a6e7495bbcabee1ee319bc4ff81e77a0ec22bd8 [2022-02-20 14:34:23,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:34:23,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:34:23,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:34:23,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:34:23,174 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:34:23,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ssinaf.c [2022-02-20 14:34:23,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed83242b2/5fc31cf5efda4ee8a6f8b506ab422b2e/FLAG19ed295ae [2022-02-20 14:34:23,622 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:34:23,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ssinaf.c [2022-02-20 14:34:23,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed83242b2/5fc31cf5efda4ee8a6f8b506ab422b2e/FLAG19ed295ae [2022-02-20 14:34:23,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed83242b2/5fc31cf5efda4ee8a6f8b506ab422b2e [2022-02-20 14:34:23,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:34:23,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:34:23,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:34:23,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:34:23,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:34:23,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:23,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108b57f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23, skipping insertion in model container [2022-02-20 14:34:23,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:23,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:34:23,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:34:23,868 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/ssinaf.c[589,602] [2022-02-20 14:34:23,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:34:23,915 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:34:23,925 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/ssinaf.c[589,602] [2022-02-20 14:34:23,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:34:23,968 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:34:23,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23 WrapperNode [2022-02-20 14:34:23,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:34:23,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:34:23,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:34:23,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:34:23,976 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:34:23" (1/1) ... [2022-02-20 14:34:23,980 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:34:23" (1/1) ... [2022-02-20 14:34:23,996 INFO L137 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2022-02-20 14:34:23,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:34:23,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:34:23,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:34:23,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:34:24,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:24,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:24,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:24,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:24,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:24,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:24,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:24,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:34:24,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:34:24,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:34:24,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:34:24,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23" (1/1) ... [2022-02-20 14:34:24,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:34:24,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:24,082 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:34:24,084 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:34:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:34:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:34:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:34:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:34:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:34:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:34:24,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:34:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:34:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:34:24,218 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:34:24,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:34:24,467 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:34:24,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:34:24,471 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 14:34:24,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:34:24 BoogieIcfgContainer [2022-02-20 14:34:24,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:34:24,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:34:24,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:34:24,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:34:24,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:34:23" (1/3) ... [2022-02-20 14:34:24,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc6c656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:34:24, skipping insertion in model container [2022-02-20 14:34:24,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:34:23" (2/3) ... [2022-02-20 14:34:24,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc6c656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:34:24, skipping insertion in model container [2022-02-20 14:34:24,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:34:24" (3/3) ... [2022-02-20 14:34:24,484 INFO L111 eAbstractionObserver]: Analyzing ICFG ssinaf.c [2022-02-20 14:34:24,487 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:34:24,488 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:34:24,526 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:34:24,532 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:34:24,533 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:34:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 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:34:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:34:24,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:24,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:24,551 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash -635308358, now seen corresponding path program 1 times [2022-02-20 14:34:24,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:24,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779785123] [2022-02-20 14:34:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:24,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#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; {33#true} is VALID [2022-02-20 14:34:24,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#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~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~post16#1, main_#t~mem20#1, main_#t~post19#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, 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; {33#true} is VALID [2022-02-20 14:34:24,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#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; {33#true} is VALID [2022-02-20 14:34:24,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {34#false} is VALID [2022-02-20 14:34:24,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(8);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;call write~int(0, main_~#sum~0#1.base, main_~#sum~0#1.offset, 8);main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:34:24,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume !(main_~i~0#1 < ~N~0); {34#false} is VALID [2022-02-20 14:34:24,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#false} main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:34:24,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} assume !(main_~i~0#1 < ~N~0); {34#false} is VALID [2022-02-20 14:34:24,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:34:24,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume !(main_~i~0#1 < ~N~0); {34#false} is VALID [2022-02-20 14:34:24,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} call write~int(1, main_~#sum~0#1.base, main_~#sum~0#1.offset, 8);main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:34:24,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 14:34:24,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:34:24,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 14:34:24,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:34:24,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem20#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~mem20#1 == (1 + ~N~0) * (1 + ~N~0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {34#false} is VALID [2022-02-20 14:34:24,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == __VERIFIER_assert_~cond#1; {34#false} is VALID [2022-02-20 14:34:24,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 14:34:24,737 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:34:24,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:24,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779785123] [2022-02-20 14:34:24,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779785123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:24,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:24,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:34:24,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753711081] [2022-02-20 14:34:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:24,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:34:24,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:24,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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:34:24,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:24,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:34:24,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:24,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:34:24,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:34:24,803 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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:34:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:24,850 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2022-02-20 14:34:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:34:24,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:34:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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:34:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2022-02-20 14:34:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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:34:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2022-02-20 14:34:24,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 82 transitions. [2022-02-20 14:34:24,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:24,949 INFO L225 Difference]: With dead ends: 56 [2022-02-20 14:34:24,950 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:34:24,952 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:34:24,954 INFO L933 BasicCegarLoop]: 36 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, 36 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:34:24,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:34:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:34:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 14:34:24,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:24,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:24,978 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:24,978 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:24,982 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 14:34:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 14:34:24,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:24,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:24,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 14:34:24,984 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 14:34:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:24,986 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 14:34:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 14:34:24,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:24,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:24,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:24,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-02-20 14:34:24,989 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2022-02-20 14:34:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:24,991 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-20 14:34:24,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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:34:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 14:34:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:34:24,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:24,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:34:24,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:34:24,994 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:24,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:25,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1344199344, now seen corresponding path program 1 times [2022-02-20 14:34:25,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:25,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095898883] [2022-02-20 14:34:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:34:25,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#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; {191#true} is VALID [2022-02-20 14:34:25,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#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~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~post16#1, main_#t~mem20#1, main_#t~post19#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, 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; {191#true} is VALID [2022-02-20 14:34:25,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#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; {193#(<= 1 ~N~0)} is VALID [2022-02-20 14:34:25,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {193#(<= 1 ~N~0)} is VALID [2022-02-20 14:34:25,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {193#(<= 1 ~N~0)} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(8);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;call write~int(0, main_~#sum~0#1.base, main_~#sum~0#1.offset, 8);main_~i~0#1 := 0; {194#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} is VALID [2022-02-20 14:34:25,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} assume !(main_~i~0#1 < ~N~0); {192#false} is VALID [2022-02-20 14:34:25,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {192#false} main_~i~0#1 := 0; {192#false} is VALID [2022-02-20 14:34:25,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#false} assume !(main_~i~0#1 < ~N~0); {192#false} is VALID [2022-02-20 14:34:25,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {192#false} main_~i~0#1 := 0; {192#false} is VALID [2022-02-20 14:34:25,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {192#false} assume !(main_~i~0#1 < ~N~0); {192#false} is VALID [2022-02-20 14:34:25,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {192#false} call write~int(1, main_~#sum~0#1.base, main_~#sum~0#1.offset, 8);main_~i~0#1 := 0; {192#false} is VALID [2022-02-20 14:34:25,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {192#false} assume !(main_~i~0#1 < ~N~0); {192#false} is VALID [2022-02-20 14:34:25,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {192#false} main_~i~0#1 := 0; {192#false} is VALID [2022-02-20 14:34:25,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {192#false} assume !(main_~i~0#1 < ~N~0); {192#false} is VALID [2022-02-20 14:34:25,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#false} main_~i~0#1 := 0; {192#false} is VALID [2022-02-20 14:34:25,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {192#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem20#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~mem20#1 == (1 + ~N~0) * (1 + ~N~0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {192#false} is VALID [2022-02-20 14:34:25,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {192#false} assume 0 == __VERIFIER_assert_~cond#1; {192#false} is VALID [2022-02-20 14:34:25,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-02-20 14:34:25,111 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:34:25,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:34:25,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095898883] [2022-02-20 14:34:25,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095898883] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:34:25,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:34:25,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:34:25,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351796612] [2022-02-20 14:34:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:34:25,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:34:25,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:34:25,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:34:25,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:25,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:34:25,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:34:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:34:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:34:25,131 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:34:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:25,239 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-02-20 14:34:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:34:25,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:34:25,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:34:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:34:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-02-20 14:34:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:34:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-02-20 14:34:25,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-02-20 14:34:25,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:34:25,324 INFO L225 Difference]: With dead ends: 61 [2022-02-20 14:34:25,324 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 14:34:25,324 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:34:25,325 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:34:25,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 18 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:34:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 14:34:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-02-20 14:34:25,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:34:25,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:25,336 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:25,336 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:25,338 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-02-20 14:34:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-02-20 14:34:25,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:25,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:25,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:34:25,339 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:34:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:34:25,340 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-02-20 14:34:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-02-20 14:34:25,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:34:25,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:34:25,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:34:25,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:34:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:34:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-02-20 14:34:25,342 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2022-02-20 14:34:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:34:25,342 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-02-20 14:34:25,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:34:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-02-20 14:34:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:34:25,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:34:25,343 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, 1, 1, 1, 1] [2022-02-20 14:34:25,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:34:25,344 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:34:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:34:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash -933126362, now seen corresponding path program 1 times [2022-02-20 14:34:25,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:34:25,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964781439] [2022-02-20 14:34:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:34:25,374 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:34:25,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604688143] [2022-02-20 14:34:25,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:34:25,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:34:25,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:34:25,376 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:34:25,377 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:34:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:34:25,434 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 14:34:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:34:25,486 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 14:34:25,487 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 14:34:25,487 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:34:25,545 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:34:25,719 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:34:25,722 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 14:34:25,724 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:34:25,752 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:34:25,753 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:34:25,753 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:34:25,753 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:34:25,753 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 14:34:25,754 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:34:25,757 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:34:25,757 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:34:25,757 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 14:34:25,757 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 14:34:25,757 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 14:34:25,757 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 14:34:25,757 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2022-02-20 14:34:25,757 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 14:34:25,757 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 14:34:25,758 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 14:34:25,758 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 14:34:25,758 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2022-02-20 14:34:25,758 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 14:34:25,758 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-02-20 14:34:25,759 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-02-20 14:34:25,759 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-02-20 14:34:25,759 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2022-02-20 14:34:25,759 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 14:34:25,759 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 14:34:25,759 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 14:34:25,775 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 14:34:25,775 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-02-20 14:34:25,775 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 14:34:25,775 WARN L170 areAnnotationChecker]: L53-3 has no Hoare annotation [2022-02-20 14:34:25,775 WARN L170 areAnnotationChecker]: L53-3 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L53-3 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L53-4 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L58-3 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L58-3 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L58-3 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L58-4 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:34:25,776 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:34:25,777 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:34:25,777 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2022-02-20 14:34:25,777 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-02-20 14:34:25,777 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:34:25,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:34:25 BoogieIcfgContainer [2022-02-20 14:34:25,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:34:25,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:34:25,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:34:25,778 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:34:25,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:34:24" (3/4) ... [2022-02-20 14:34:25,780 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 14:34:25,847 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:34:25,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:34:25,849 INFO L158 Benchmark]: Toolchain (without parser) took 2197.78ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 68.7MB in the beginning and 70.8MB in the end (delta: -2.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-02-20 14:34:25,849 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:34:25,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.19ms. Allocated memory is still 100.7MB. Free memory was 68.5MB in the beginning and 75.6MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:34:25,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.10ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:34:25,850 INFO L158 Benchmark]: Boogie Preprocessor took 20.30ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 71.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:34:25,850 INFO L158 Benchmark]: RCFGBuilder took 454.43ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 57.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 14:34:25,851 INFO L158 Benchmark]: TraceAbstraction took 1304.09ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 57.2MB in the beginning and 75.0MB in the end (delta: -17.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-02-20 14:34:25,851 INFO L158 Benchmark]: Witness Printer took 69.82ms. Allocated memory is still 121.6MB. Free memory was 75.0MB in the beginning and 70.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 14:34:25,852 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.18ms. Allocated memory is still 100.7MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.19ms. Allocated memory is still 100.7MB. Free memory was 68.5MB in the beginning and 75.6MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.10ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.30ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 71.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.43ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 57.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1304.09ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 57.2MB in the beginning and 75.0MB in the end (delta: -17.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 69.82ms. Allocated memory is still 121.6MB. Free memory was 75.0MB in the beginning and 70.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 sum[1]; [L29] long long *a = malloc(sizeof(long long)*N); [L31] sum[0] = 0 [L32] i=0 VAL [a={-1:0}, i=0, N=1, sum={4:0}] [L32] COND TRUE i