./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test23-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/ldv-regression/test23-1.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 4c2b7377d2b430a15e16457512411598a883b6588c528bba211e64f887de4d8e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:28:03,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:28:03,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:28:03,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:28:03,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:28:03,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:28:03,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:28:03,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:28:03,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:28:03,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:28:03,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:28:03,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:28:03,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:28:03,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:28:03,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:28:03,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:28:03,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:28:03,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:28:03,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:28:03,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:28:03,405 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:28:03,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:28:03,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:28:03,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:28:03,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:28:03,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:28:03,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:28:03,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:28:03,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:28:03,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:28:03,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:28:03,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:28:03,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:28:03,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:28:03,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:28:03,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:28:03,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:28:03,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:28:03,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:28:03,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:28:03,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:28:03,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:28:03,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:28:03,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:28:03,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:28:03,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:28:03,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:28:03,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:28:03,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:28:03,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:28:03,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:28:03,463 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:28:03,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:28:03,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:28:03,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:28:03,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:28:03,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:28:03,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:28:03,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:28:03,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:28:03,465 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:28:03,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:28:03,467 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:28:03,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:28:03,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:28:03,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:28:03,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:28:03,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:03,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:28:03,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:28:03,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:28:03,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:28:03,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:28:03,469 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:28:03,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:28:03,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:28:03,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c2b7377d2b430a15e16457512411598a883b6588c528bba211e64f887de4d8e [2022-07-19 14:28:03,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:28:03,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:28:03,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:28:03,768 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:28:03,769 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:28:03,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test23-1.c [2022-07-19 14:28:03,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b6e7acf4/c380d8b41a7c4483be5b87f4a40a72ff/FLAG516d415f2 [2022-07-19 14:28:04,297 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:28:04,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c [2022-07-19 14:28:04,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b6e7acf4/c380d8b41a7c4483be5b87f4a40a72ff/FLAG516d415f2 [2022-07-19 14:28:04,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b6e7acf4/c380d8b41a7c4483be5b87f4a40a72ff [2022-07-19 14:28:04,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:28:04,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:28:04,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:04,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:28:04,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:28:04,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595c80c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04, skipping insertion in model container [2022-07-19 14:28:04,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:28:04,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:28:04,521 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/ldv-regression/test23-1.c[1075,1088] [2022-07-19 14:28:04,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:04,531 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:28:04,550 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/ldv-regression/test23-1.c[1075,1088] [2022-07-19 14:28:04,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:04,563 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:28:04,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04 WrapperNode [2022-07-19 14:28:04,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:04,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:04,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:28:04,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:28:04,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,605 INFO L137 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-07-19 14:28:04,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:04,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:28:04,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:28:04,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:28:04,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:28:04,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:28:04,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:28:04,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:28:04,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (1/1) ... [2022-07-19 14:28:04,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:04,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:04,669 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-07-19 14:28:04,675 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-07-19 14:28:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:28:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:28:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:28:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-07-19 14:28:04,704 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-07-19 14:28:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:28:04,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:28:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:28:04,794 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:28:04,796 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:28:04,994 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:28:04,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:28:04,999 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 14:28:05,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:05 BoogieIcfgContainer [2022-07-19 14:28:05,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:28:05,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:28:05,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:28:05,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:28:05,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:28:04" (1/3) ... [2022-07-19 14:28:05,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b669eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:05, skipping insertion in model container [2022-07-19 14:28:05,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:04" (2/3) ... [2022-07-19 14:28:05,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b669eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:05, skipping insertion in model container [2022-07-19 14:28:05,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:05" (3/3) ... [2022-07-19 14:28:05,015 INFO L111 eAbstractionObserver]: Analyzing ICFG test23-1.c [2022-07-19 14:28:05,029 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:28:05,030 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:28:05,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:28:05,105 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1985d152, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@514b8956 [2022-07-19 14:28:05,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:28:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:28:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 14:28:05,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:05,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:05,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -203522095, now seen corresponding path program 1 times [2022-07-19 14:28:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:05,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194704421] [2022-07-19 14:28:05,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:05,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:28:05,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:05,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194704421] [2022-07-19 14:28:05,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194704421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:05,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:05,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:28:05,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114237066] [2022-07-19 14:28:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:05,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:28:05,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:05,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:28:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:28:05,466 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:28:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:05,483 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-07-19 14:28:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:28:05,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-07-19 14:28:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:05,491 INFO L225 Difference]: With dead ends: 32 [2022-07-19 14:28:05,492 INFO L226 Difference]: Without dead ends: 19 [2022-07-19 14:28:05,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-07-19 14:28:05,498 INFO L413 NwaCegarLoop]: 26 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, 26 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-07-19 14:28:05,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:28:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-19 14:28:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-19 14:28:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:28:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-19 14:28:05,529 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 21 [2022-07-19 14:28:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:05,531 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-19 14:28:05,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:28:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-19 14:28:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 14:28:05,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:05,533 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:05,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:28:05,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2074741797, now seen corresponding path program 1 times [2022-07-19 14:28:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:05,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085933502] [2022-07-19 14:28:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:05,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:28:05,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:05,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085933502] [2022-07-19 14:28:05,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085933502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:05,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:05,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 14:28:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821762490] [2022-07-19 14:28:05,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:05,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:28:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:05,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:28:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:28:05,869 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:28:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:06,126 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-07-19 14:28:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:28:06,127 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-07-19 14:28:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:06,129 INFO L225 Difference]: With dead ends: 44 [2022-07-19 14:28:06,129 INFO L226 Difference]: Without dead ends: 39 [2022-07-19 14:28:06,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-19 14:28:06,131 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:06,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 124 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:28:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-19 14:28:06,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 21. [2022-07-19 14:28:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:28:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-07-19 14:28:06,146 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 22 [2022-07-19 14:28:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:06,146 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-07-19 14:28:06,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:28:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-07-19 14:28:06,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:28:06,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:06,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:06,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:28:06,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:06,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:06,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1823127190, now seen corresponding path program 1 times [2022-07-19 14:28:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:06,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068590013] [2022-07-19 14:28:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:06,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:28:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:06,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068590013] [2022-07-19 14:28:06,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068590013] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:06,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596142406] [2022-07-19 14:28:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:06,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:06,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:06,517 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-07-19 14:28:06,519 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-07-19 14:28:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:06,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 14:28:06,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:07,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-19 14:28:07,252 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-07-19 14:28:07,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 12 [2022-07-19 14:28:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:28:07,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:07,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2022-07-19 14:28:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:28:07,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596142406] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:07,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:07,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2022-07-19 14:28:07,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696820067] [2022-07-19 14:28:07,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:07,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-19 14:28:07,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:07,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-19 14:28:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2022-07-19 14:28:07,806 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 35 states, 32 states have (on average 1.5) internal successors, (48), 29 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:28:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:09,133 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-07-19 14:28:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-19 14:28:09,134 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 1.5) internal successors, (48), 29 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2022-07-19 14:28:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:09,135 INFO L225 Difference]: With dead ends: 59 [2022-07-19 14:28:09,135 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 14:28:09,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=538, Invalid=3122, Unknown=0, NotChecked=0, Total=3660 [2022-07-19 14:28:09,138 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 113 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:09,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 322 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 399 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2022-07-19 14:28:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 14:28:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 27. [2022-07-19 14:28:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:28:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-19 14:28:09,154 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-07-19 14:28:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:09,155 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-19 14:28:09,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 1.5) internal successors, (48), 29 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:28:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-19 14:28:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 14:28:09,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:09,158 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:09,188 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-07-19 14:28:09,379 WARN L477 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-07-19 14:28:09,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:09,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1605447239, now seen corresponding path program 2 times [2022-07-19 14:28:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:09,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843864239] [2022-07-19 14:28:09,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:09,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:28:09,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:09,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843864239] [2022-07-19 14:28:09,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843864239] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:09,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370643376] [2022-07-19 14:28:09,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:28:09,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:09,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:09,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:28:09,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:28:09,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:28:09,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:28:09,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 14:28:09,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:09,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-19 14:28:09,988 INFO L356 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2022-07-19 14:28:09,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 18 [2022-07-19 14:28:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:28:09,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:28:10,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370643376] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:10,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:10,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 27 [2022-07-19 14:28:10,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283253732] [2022-07-19 14:28:10,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:10,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-19 14:28:10,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:10,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-19 14:28:10,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-07-19 14:28:10,118 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:28:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:11,369 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-07-19 14:28:11,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-19 14:28:11,371 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-07-19 14:28:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:11,375 INFO L225 Difference]: With dead ends: 80 [2022-07-19 14:28:11,375 INFO L226 Difference]: Without dead ends: 75 [2022-07-19 14:28:11,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1480 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1124, Invalid=3846, Unknown=0, NotChecked=0, Total=4970 [2022-07-19 14:28:11,383 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 78 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:11,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 163 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:28:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-19 14:28:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 39. [2022-07-19 14:28:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:28:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-07-19 14:28:11,403 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 30 [2022-07-19 14:28:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:11,410 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-07-19 14:28:11,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:28:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-07-19 14:28:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 14:28:11,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:11,412 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:11,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:11,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 14:28:11,628 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2039796585, now seen corresponding path program 3 times [2022-07-19 14:28:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:11,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463065574] [2022-07-19 14:28:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:28:12,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:12,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463065574] [2022-07-19 14:28:12,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463065574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:12,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645756134] [2022-07-19 14:28:12,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:28:12,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:12,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:12,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:28:12,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:28:12,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-19 14:28:12,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:28:12,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 14:28:12,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:12,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-19 14:28:12,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:28:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:28:12,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:28:12,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645756134] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:12,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:12,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 14] total 24 [2022-07-19 14:28:12,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782334029] [2022-07-19 14:28:12,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:12,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 14:28:12,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:12,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 14:28:12,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2022-07-19 14:28:12,436 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:28:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:13,735 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-07-19 14:28:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-19 14:28:13,735 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-07-19 14:28:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:13,736 INFO L225 Difference]: With dead ends: 84 [2022-07-19 14:28:13,736 INFO L226 Difference]: Without dead ends: 79 [2022-07-19 14:28:13,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1302, Invalid=4248, Unknown=0, NotChecked=0, Total=5550 [2022-07-19 14:28:13,739 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 132 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:13,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 90 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 158 Invalid, 0 Unknown, 4 Unchecked, 0.2s Time] [2022-07-19 14:28:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-19 14:28:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2022-07-19 14:28:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:28:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-07-19 14:28:13,748 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 42 [2022-07-19 14:28:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:13,749 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-07-19 14:28:13,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:28:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-07-19 14:28:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 14:28:13,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:13,750 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:13,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:13,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:13,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -229632676, now seen corresponding path program 4 times [2022-07-19 14:28:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439765704] [2022-07-19 14:28:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:28:14,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 14:28:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:28:14,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 14:28:14,092 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 14:28:14,093 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:28:14,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 14:28:14,098 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-07-19 14:28:14,101 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:28:14,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:28:14 BoogieIcfgContainer [2022-07-19 14:28:14,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:28:14,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:28:14,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:28:14,142 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:28:14,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:05" (3/4) ... [2022-07-19 14:28:14,145 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 14:28:14,193 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:28:14,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:28:14,196 INFO L158 Benchmark]: Toolchain (without parser) took 9863.73ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 62.2MB in the beginning and 37.7MB in the end (delta: 24.6MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2022-07-19 14:28:14,196 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 94.4MB. Free memory was 49.7MB in the beginning and 49.7MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:28:14,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.74ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 70.5MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 14:28:14,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.40ms. Allocated memory is still 94.4MB. Free memory was 70.5MB in the beginning and 68.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:28:14,197 INFO L158 Benchmark]: Boogie Preprocessor took 20.55ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:28:14,208 INFO L158 Benchmark]: RCFGBuilder took 372.84ms. Allocated memory is still 94.4MB. Free memory was 67.3MB in the beginning and 56.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 14:28:14,208 INFO L158 Benchmark]: TraceAbstraction took 9139.13ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 56.2MB in the beginning and 41.9MB in the end (delta: 14.3MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2022-07-19 14:28:14,208 INFO L158 Benchmark]: Witness Printer took 53.17ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 37.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:28:14,210 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 94.4MB. Free memory was 49.7MB in the beginning and 49.7MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.74ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 70.5MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.40ms. Allocated memory is still 94.4MB. Free memory was 70.5MB in the beginning and 68.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.55ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.84ms. Allocated memory is still 94.4MB. Free memory was 67.3MB in the beginning and 56.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9139.13ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 56.2MB in the beginning and 41.9MB in the end (delta: 14.3MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Witness Printer took 53.17ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 37.7MB 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: 52]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] struct dummy d1, d2; VAL [d1={4:0}, d2={5:0}] [L35] CALL init() [L16] d1.a = __VERIFIER_nondet_int() [L17] d1.b = __VERIFIER_nondet_int() [L19] d2.a = __VERIFIER_nondet_int() [L20] d2.b = __VERIFIER_nondet_int() [L35] RET init() [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={4:0}, d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, get_dummy()={4:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={4:0}, d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, get_dummy()={4:0}, pd1={4:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L37] int i = __VERIFIER_nondet_int(); [L38] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L39] pd2->array[i] = i [L40] int *pa = &pd1->array[i]; [L41] EXPR pd2->array[i] [L41] i = pd2->array[i] - 10 [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=-4, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-3, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=-3, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-2, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=-2, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-1, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=-1, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=0, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=0, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=1, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=1, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=2, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=2, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=3, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=3, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=4, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=4, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=5, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=5, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=6, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=6, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=7, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=7, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] COND FALSE !(i <= *pa) [L45] CALL, EXPR check(pd2, i) [L30] EXPR s1->array[i] [L30] return s1->array[i] == i; [L45] RET, EXPR check(pd2, i) [L45] COND TRUE !check(pd2, i) [L52] reach_error() VAL [d1={4:0}, d2={5:0}, i=7, pa={4:32}, pd1={4:0}, pd2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 725 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 66 IncrementalHoareTripleChecker+Unchecked, 632 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 917 IncrementalHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 93 mSDtfsCounter, 917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 174 SyntacticMatches, 9 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=5, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 119 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 320 ConstructedInterpolants, 5 QuantifiedInterpolants, 2383 SizeOfPredicates, 36 NumberOfNonLiveVariables, 543 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 38/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 14:28:14,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE